Search

We investigate the topological quantum compilation of two-qubit operations within a system of Fibonacci anyons. Our primary goal is to generate gates that are approximately leakage-free and equivalent to the controlled-NOT (CNOT) gate up to single-qubit operations. These gates belong to the local equivalence class [CNOT]. Additionally, we explore which local equivalence classes of two-qubit operations can be naturally generated by braiding Fibonacci anyons. We discovered that most of the generated classes are located near the edges of the Weyl chamber representation of two-qubit gates, specifically between the local equivalence classes of the identity [1] and [CNOT], and between those of the double-controlled-NOT [DCNOT] and [SWAP]. Furthermore, we found a numerically exact implementation of a local equivalent of the SWAP gate using a sequence of only nine elements from the Fibonacci braiding gate set., Comment: 13 pages, 8 tables, 4 figures

We present Stochastic Optical Quantum Circuit Simulator (SOQCS) C++/Python library for the simulation of quantum optical circuits, and we provide its implementation details. SOQCS offers a framework to define, simulate and study quantum linear optical circuits in the presence of various imperfections. These come from partial distinguishability of photons, lossy propagation media, unbalanced beamsplitters and non-ideal emitters and detectors for example. SOQCS is developed as a series of different modules which provide quantum circuits, different simulator cores and tools to analyze the output. Quantum circuits can be defined from basic components, including emitters, linear optical elements, delays and detectors. Post-selection can be configured straightforwardly as part of detector definitions. An important attribute of SOQCS is its modularity which allows for its further development in the future., Comment: 23 pages, 10 figures

We introduce AQCtensor, a novel algorithm to produce short-depth quantum circuits from Matrix Product States (MPS). Our approach is specifically tailored to the preparation of quantum states generated from the time evolution of quantum many-body Hamiltonians. This tailored approach has two clear advantages over previous algorithms that were designed to map a generic MPS to a quantum circuit. First, we optimize all parameters of a parametric circuit at once using Approximate Quantum Compiling (AQC) - this is to be contrasted with other approaches based on locally optimizing a subset of circuit parameters and "sweeping" across the system. We introduce an optimization scheme to avoid the so-called ``orthogonality catastrophe" - i.e. the fact that the fidelity of two arbitrary quantum states decays exponentially with the number of qubits - that would otherwise render a global optimization of the circuit impractical. Second, the depth of our parametric circuit is constant in the number of qubits for a fixed simulation time and fixed error tolerance. This is to be contrasted with the linear circuit Ansatz used in generic algorithms whose depth scales linearly in the number of qubits. For simulation problems on 100 qubits, we show that AQCtensor thus achieves at least an order of magnitude reduction in the depth of the resulting optimized circuit, as compared with the best generic MPS to quantum circuit algorithms. We demonstrate our approach on simulation problems on Heisenberg-like Hamiltonians on up to 100 qubits and find optimized quantum circuits that have significantly reduced depth as compared to standard Trotterized circuits.

Quantum compilation provides a method to translate quantum algorithms at a high level of abstraction into their implementations as quantum circuits on real hardware. One approach to quantum compiling is to design a parameterised circuit and to use techniques from optimisation to find the parameters that minimise the distance between the parameterised circuit and the target circuit of interest. While promising, such an approach typically runs into the obstacle of barren plateaus - i.e. large regions of parameter space in which the gradient vanishes. A number of recent works focusing on so-called quantum assisted quantum compiling have developed new techniques to induce gradients in some particular cases. Here we develop and implement a set of related techniques such that they can be applied to classically assisted quantum compiling. We consider both approximate state preparation and approximate circuit preparation and show that, in both cases, we can significantly improve convergence with the approach developed in this work.

We present a construction of the Kitaev honeycomb lattice model on an arbitrary higher genus surface. We first generalize the exact solution of the model based on the Jordan-Wigner fermionization to a surface with genus $g = 2$, and then use this as a basic module to extend the solution to lattices of arbitrary genus. We demonstrate our method by calculating the ground states of the model in both the Abelian doubled $\mathbb{Z}_2$ phase and the non-Abelian Ising topological phase on lattices with the genus up to $g = 6$. We verify the expected ground state degeneracy of the system in both topological phases and further illuminate the role of fermionic parity in the Abelian phase.

We are concerned with numerical simulations of quantum optical circuits under certain realistic conditions, specifically that photon quantum states are not perfectly indistinguishable. The partial photon distinguishability presents a serious limitation in implementation of optical quantum information processing. In order to properly assess its effect on quantum information protocols, accurate numerical simulations, which closely emulate quantum circuit operations, are essential. Our specific objective is to provide a computer implementation of the partial photon distinguishability which is in principle applicable to existing simulation techniques used for ideal quantum circuits and which avoids a need for their significant modification. Our approach is based on the Gram-Schmidt orthonormalization process, which is well suited for our purpose. Photonic quantum states are represented by wavepackets which contain information on their time and frequency distributions. In order to account for the partial photon distinguishability, we expand the number of degrees of freedom associated with the circuit operation extending the definition of the photon channels to incorporate wavepacket degrees of freedom. This strategy allows to define delay operations in the same footing as the linear optical elements., Comment: 11 pages, 5 figures

We examine the thermalisation/localization trade off in an interacting and disordered Kitaev model, specifically addressing whether signatures of many-body localization can coexist with the systems topological phase. Using methods applicable to finite size systems, (e.g. the generalized one-particle density matrix, eigenstate entanglement entropy, inverse zero modes coherence length) we identify a regime of parameter space in the vicinity of the non-interacting limit where topological superconductivity survives together with a significant violation of Eigenstate-Thermalisation-Hypothesis (ETH) at finite energy-densities. We further identify an anomalous behaviour of the von Neumann entanglement entropy which can be attributed to the prethermalisation-like effects that occur due to lack of hybridization between high-energy eigenstates reflecting an approximate particle conservation law. In this regime the system tends to thermalise to a generalised Gibbs ensemble (as opposed to the grand canonical ensemble). Moderate disorder tends to drive the system towards stronger hybridization and a standard thermal ensemble, where the approximate conservation law is violated. This behaviour is cutoff by strong disorder which obstructs many body effects thus violating ETH and reducing the entanglement entropy., Comment: 11 pages, 10 figures

Quantum optimal control has numerous important applications ranging from pulse shaping in magnetic-resonance imagining to laser control of chemical reactions and quantum computing. Our objective is to address two major challenges that have limited the success of applications of quantum optimal control so far: non-commutativity inherent in quantum systems and non-convexity of quantum optimal control problems involving more than three quantum levels. Methodologically, we address the non-commutativity of the control Hamiltonian at different times by the use of Magnus expansion. To tackle the non-convexity, we employ non-commutative polynomial optimisation and non-commutative geometry. As a result, we present the first globally convergent methods for quantum optimal control.

The Pauli groups are ubiquitous in quantum information theory because of their usefulness in describing quantum states and operations and their readily understood symmetry properties. In addition, the most well-understood quantum error correcting codes -- stabilizer codes -- are built using Pauli operators. The eigenstates of these operators -- stabilizer states -- display a structure (e.g., mutual orthogonality relationships) that has made them useful in examples of multi-qubit non-locality and contextuality. Here, we apply the graph-theoretical contextuality formalism of Cabello, Severini and Winter to sets of stabilizer states, with particular attention to the effect of generalizing two-level qubit systems to odd prime d-level qudit systems. While state-independent contextuality using two-qubit states does not generalize to qudits, we show explicitly how state-dependent contextuality associated with a Bell inequality does generalize. Along the way we note various structural properties of stabilizer states, with respect to their orthogonality relationships, which may be of independent interest., Comment: From 2013. 23 pages, 5 figures

The difficulty of an optimization task in quantum information science depends on the proper mathematical expression of the physical target. Here we demonstrate the power of optimization functionals targeting an arbitrary perfect two-qubit entangler, creating a maximally-entangled state out of some initial product state. For two quantum information platforms of current interest, nitrogen vacancy centers in diamond and superconducting Josephson junctions, we show that an arbitrary perfect entangler can be reached faster and with higher fidelity than specific two-qubit gates or local equivalence classes of two-qubit gates. Our results are obtained with two independent optimization approaches, underlining the crucial role of the optimization target.

Optimal control theory is a powerful tool for improving figures of merit in quantum information tasks. Finding the solution to any optimal control problem via numerical optimization depends crucially on the choice of the optimization functional. Here, we derive a functional that targets the full set of two-qubit perfect entanglers, gates capable of creating a maximally-entangled state out of some initial product state. The functional depends on easily-computable local invariants and uniquely determines when a gate evolves into a perfect entangler. Optimization with our functional is most useful if the two-qubit dynamics allows for the implementation of more than one perfect entangler. We discuss the reachable set of perfect entanglers for a generic Hamiltonian that corresponds to several quantum information platforms of current interest.

We show that networks of topological nanowires can realize the physics of exactly solvable Kitaev spin models with two-body interactions. This connection arises from the description of the low-energy theory of both systems in terms of a tight-binding model of Majorana modes. In Kitaev spin models the Majorana description provides a convenient representation to solve the model, whereas in an array of topological nanowires it arises, because the physical Majorana modes localized at wire ends permit tunnelling between wire ends and across different Josephson junctions. We explicitly show that an array of junctions of three wires -- a setup relevant to topological quantum computing with nanowires -- can realize the Yao-Kivelson model, a variant of Kitaev spin models on a decorated honeycomb lattice. Translating the results from the latter, we show that the network can be constructed to give rise to collective states characterized by Chern numbers \nu = 0, +/-1 and +/-2, and that defects in an array can be associated with vortex-like quasi-particle excitations. Finally, we analyze the stability of the collective states as well as that of the network as a quantum information processor. We show that decoherence inducing instabilities, be them due to disorder or phase fluctuations, can be understood in terms of proliferation of the vortex-like quasi-particles., Comment: 15 pages, 9 figures

We define a double affine $Q$-dependent braid group. This group is constructed by appending to the braid group a set of operators $Q_i$, before extending it to an affine $Q$-dependent braid group. We show specifically that the elliptic braid group and the double affine Hecke algebra (DAHA) can be obtained as quotient groups. Complementing this we present a pictorial representation of the double affine $Q$-dependent braid group based on ribbons living in a toroid. We show that in this pictorial representation we can fully describe any DAHA. Specifically, we graphically describe the parameter $q$ upon which this algebra is dependent and show that in this particular representation $q$ corresponds to a twist in the ribbon.

We derive expressions for the invariant length element and measure for the simple compact Lie group SU(4) in a coordinate system particularly suitable for treating entanglement in quantum information processing. Using this metric, we compute the invariant volume of the space of two-qubit perfect entanglers. We find that this volume corresponds to more than 84% of the total invariant volume of the space of two-qubit gates. This same metric is also used to determine the effective target sizes that selected gates will present in any quantum-control procedure designed to implement them., Comment: 27 pages, 5 figures

When visualised as an operation on the Bloch sphere, the qubit "pi-over-eight" gate corresponds to one-eighth of a complete rotation about the vertical axis. This simple gate often plays an important role in quantum information theory, typically in situations for which Pauli and Clifford gates are insufficient. Most notably, when it supplements the set of Clifford gates then universal quantum computation can be achieved. The "pi-over-eight" gate is the simplest example of an operation from the third level of the Clifford hierarchy (i.e., it maps Pauli operations to Clifford operations under conjugation). Here we derive explicit expressions for all qudit (d-level, where d is prime) versions of this gate and analyze the resulting group structure that is generated by these diagonal gates. This group structure differs depending on whether the dimensionality of the qudit is two, three or greater than three. We then discuss the geometrical relationship of these gates (and associated states) with respect to Clifford gates and stabilizer states. We present evidence that these gates are maximally robust to depolarizing and phase damping noise, in complete analogy with the qubit case. Motivated by this and other similarities we conjecture that these gates could be useful for the task of qudit magic-state distillation and, by extension, fault-tolerant quantum computing. Very recent, independent work by Campbell, Anwar and Browne confirms the correctness of this intuition, and we build upon their work to characterize noise regimes for which noisy implementations of these gates can (or provably cannot) supplement Clifford gates to enable universal quantum computation., Comment: Version 2 changed to reflect improved distillation routines in arXiv:1205.3104v2. Minor typos fixed. 12 Pages,2 Figures,3 Tables

An obstacle affecting any proposal for a topological quantum computer based on Ising anyons is that quasiparticle braiding can only implement a finite (non-universal) set of quantum operations. The computational power of this restricted set of operations (often called stabilizer operations) has been studied in quantum information theory, and it is known that no quantum-computational advantage can be obtained without the help of an additional non-stabilizer operation. Similarly, a bipartite two-qubit system based on Ising anyons cannot exhibit non-locality (in the sense of violating a Bell inequality) when only topologically protected stabilizer operations are performed. To produce correlations that cannot be described by a local hidden variable model again requires the use of a non-stabilizer operation. Using geometric techniques, we relate the sets of operations that enable universal quantum computing (UQC) with those that enable violation of a Bell inequality. Motivated by the fact that non-stabilizer operations are expected to be highly imperfect, our aim is to provide a benchmark for identifying UQC-enabling operations that is both experimentally practical and conceptually simple. We show that any (noisy) single-qubit non-stabilizer operation that, together with perfect stabilizer operations, enables violation of the simplest two-qubit Bell inequality can also be used to enable UQC. This benchmarking requires finding the expectation values of two distinct Pauli measurements on each qubit of a bipartite system., Comment: 12 pages, 2 figures

We develop a rigorous and highly accurate technique for calculation of the Berry phase in systems with a quadratic Hamiltonian within the context of the Kitaev honeycomb lattice model. The method is based on the recently found solution of the model which uses the Jordan-Wigner-type fermionization in an exact effective spin-hardcore boson representation. We specifically simulate the braiding of two non-Abelian vortices (anyons) in a four vortex system characterized by a two-fold degenerate ground state. The result of the braiding is the non-Abelian Berry matrix which is in excellent agreement with the predictions of the effective field theory. The most precise results of our simulation are characterized by an error on the order of $10^{-5}$ or lower. We observe exponential decay of the error with the distance between vortices, studied in the range from one to nine plaquettes. We also study its correlation with the involved energy gaps and provide preliminary analysis of the relevant adiabaticity conditions. The work allows to investigate the Berry phase in other lattice models including the Yao-Kivelson model and particularly the square-octagon model. It also opens the possibility of studying the Berry phase under non-adiabatic and other effects which may constitute important sources of errors in topological quantum computation., Comment: 27 pages, 9 figures, 3 appendices

We make a detailed analysis of error mechanisms, gate fidelity, and scalability of proposals for quantum computation with neutral atoms in addressable (large lattice constant) optical lattices. We have identified possible limits to the size of quantum computations, arising in 3D optical lattices from current limitations on the ability to perform single qubit gates in parallel and in 2D lattices from constraints on laser power. Our results suggest that 3D arrays as large as 100 x 100 x 100 sites (i.e., $\sim 10^6$ qubits) may be achievable, provided two-qubit gates can be performed with sufficiently high precision and degree of parallelizability. Parallelizability of long range interaction-based two-qubit gates is qualitatively compared to that of collisional gates. Different methods of performing single qubit gates are compared, and a lower bound of $1 \times 10^{-5}$ is determined on the error rate for the error mechanisms affecting $^{133}$Cs in a blue-detuned lattice with Raman transition-based single qubit gates, given reasonable limits on experimental parameters., Comment: 17 pages, 5 figures. Accepted for publication in Physical Review A

The spectral properties of Kitaev's honeycomb lattice model are investigated both analytically and numerically with the focus on the non-abelian phase of the model. After summarizing the fermionization technique which maps spins into free Majorana fermions, we evaluate the spectrum of sparse vortex configurations and derive the interaction between two vortices as a function of their separation. We consider the effect vortices can have on the fermionic spectrum as well as on the phase transition between the abelian and non-abelian phases. We explicitly demonstrate the $2^n$-fold ground state degeneracy in the presence of $2n$ well separated vortices and the lifting of the degeneracy due to their short-range interactions. The calculations are performed on an infinite lattice. In addition to the analytic treatment, a numerical study of finite size systems is performed which is in exact agreement with the theoretical considerations. The general spectral properties of the non-abelian phase are considered for various finite toroidal systems., Comment: 32 pages, 13 figures; corrected typos and changed SU(2)_2 to Ising

LAPACK and ScaLAPACK are arguably the defacto standard libraries among the scientific community for solving linear algebra problems on sequential, shared-memory and distributed-memory architectures. While ease of use was a major design goal for the ScaLAPACK project; with respect to its predecessor LAPACK; it is still a non-trivial exercise to develop a new code or modify an existing LAPACK code to exploit processor grids, distributed-array descriptors and the associated distributed-memory ScaLAPACK/PBLAS routines. In this paper, we introduce what we believe will be an invaluable development tool for the scientific code developer, which exploits ad-hoc polymorphism, derived-types, optional arguments, overloaded operators and conditional compilation in Fortran 95, to provide wrappers to a subset of common linear algebra kernels. These wrappers are introduced to facilitate the abstraction of low-level details which are irrelevant to the science being performed, such as target platform and execution model. By exploiting this high-level library interface, only a single code source is required with mapping onto a diverse range of execution models performed at link-time with no user modification. We conclude with a case study whereby we describe application of the LAW library in the implementation of the well-known Chebyshev Matrix Exponentiation algorithm for Hermitian matrices., Comment: 39 pages, 4 figures. To be submitted to Computer Physics Communications Journal

We present a scheme for correcting qubit loss error while quantum computing with neutral atoms in an addressable optical lattice. The qubit loss is first detected using a quantum non-demolition measurement and then transformed into a standard qubit error by inserting a new atom in the vacated lattice site. The logical qubit, encoded here into four physical qubits with the Grassl-Beth-Pellizzari code, is reconstructed via a sequence of one projective measurement, two single-qubit gates, and three controlled-NOT operations. No ancillary qubits are required. Both quantum non-demolition and projective measurements are implemented using a cavity QED system which can also detect a general leakage error and thus allow qubit loss to be corrected within the same framework. The scheme can also be applied in quantum computation with trapped ions or with photons., Comment: 5 pages, 3 figures

Optimal construction of quantum operations is a fundamental problem in the realization of quantum computation. We here introduce a newly discovered quantum gate, B, that can implement any arbitrary two-qubit quantum operation with minimal number of both two- and single-qubit gates. We show this by giving an analytic circuit that implements a generic nonlocal two-qubit operation from just two applications of the B gate. We also demonstrate that for the highly scalable Josephson junction charge qubits, the B gate is also more easily and quickly generated than the CNOT gate for physically feasible parameters., Comment: 4 pages

From a geometric approach, we derive the minimum number of applications needed for an arbitrary Controlled-Unitary gate to construct a universal quantum circuit. A new analytic construction procedure is presented and shown to be either optimal or close to optimal. This result can be extended to improve the efficiency of universal quantum circuit construction from any entangling gate. Specifically, for both the Controlled-NOT and Double-CNOT gates, we develop simple analytic ways to construct universal quantum circuits with three applications, which is the least possible., Comment: 4 pages, 3 figures

We provide an analytic way to implement any arbitrary two-qubit unitary operation, given an entangling two-qubit gate together with local gates. This is shown to provide explicit construction of a universal quantum circuit that exactly simulates arbitrary two-qubit operations in SU(4). Each block in this circuit is given in a closed form solution. We also provide a uniform upper bound of the applications of the given entangling gates, and find that exactly half of all the Controlled-Unitary gates satisfy the same upper bound as the CNOT gate. These results allow for the efficient implementation of operations in SU(4) required for both quantum computation and quantum simulation., Comment: 5 pages

We study non-local two-qubit operations from a geometric perspective. By applying a Cartan decomposition to su(4), we find that the geometric structure of non-local gates is a 3-Torus. We derive the invariants for local transformations, and connect these local invariants to the coordinates of the 3-Torus. Since different points on the 3-Torus may correspond to the same local equivalence class, we use the Weyl group theory to reduce the symmetry. We show that the local equivalence classes of two-qubit gates are in one-to-one correspondence with the points in a tetrahedron except on the base. We then study the properties of perfect entanglers, that is, the two-qubit operations that can generate maximally entangled states from some initially separable states. We provide criteria to determine whether a given two-qubit gate is a perfect entangler and establish a geometric description of perfect entanglers by making use of the tetrahedral representation of non-local gates. We find that exactly half the non-local gates are perfect entanglers. We also investigate the non-local operations generated by a given Hamiltonian. We first study the gates that can be directly generated by a Hamiltonian. Then we explicitly construct a quantum circuit that contains at most three non-local gates generated by a two-body interaction Hamiltonian, together with at most four local gates generated by single qubit terms. We prove that such a quantum circuit can simulate any arbitrary two-qubit gate exactly, and hence it provides an efficient implementation of universal quantum computation and simulation., Comment: 22 pages, 6 figures

We derive an encoded universality representation for a generalized anisotropic exchange Hamiltonian that contains cross-product terms in addition to the usual two-particle exchange terms. The recently developed algebraic approach is used to show that the minimal universality-generating encodings of one logical qubit are based on three physical qubits. We show how to generate both single- and two-qubit operations on the logical qubits, using suitably timed conjugating operations derived from analysis of the commutator algebra. The timing of the operations is seen to be crucial in allowing simplification of the gate sequences for the generalized Hamiltonian to forms similar to that derived previously for the symmetric (XY) anisotropic exchange Hamiltonian. The total number of operations needed for a controlled-Z gate up to local transformations is five. A scalable architecture is proposed., Comment: 11 pages, 4 figures

The Deutsch-Jozsa algorithm is experimentally demonstrated for three-qubit functions using pure coherent superpositions of Li$_{2}$ rovibrational eigenstates. The function's character, either constant or balanced, is evaluated by first imprinting the function, using a phase-shaped femtosecond pulse, on a coherent superposition of the molecular states, and then projecting the superposition onto an ionic final state, using a second femtosecond pulse at a specific time delay.

A coherent mechanism of robust population inversion in atomic and molecular systems by a chirped field is presented. It is demonstrated that a field of sufficiently high chirp rate imposes a certain relative phase between a ground and excited state wavefunction of a two-level system. The value of the relative phase angle is thus restricted to be negative and close to 0 or $-\pi$ for positive and negative chirp, respectively. This explains the unidirectionality of the population transfer from the ground to the excited state. In a molecular system composed of a ground and excited potential energy surface the symmetry between the action of a pulse with a large positive and negative chirp is broken. The same framwork of the coherent mechanism can explain the symmetry breaking and the population inversion due to a positive chirped field., Comment: 11 pages, 3 figures