Related papers: Holonomic Quantum Computation
In this work we present an effective Hamiltonian description of the quantum dynamics of a generalized Lambda system undergoing adiabatic evolution. We assume the system to be initialized in the dark subspace and show that its holonomic…
Quantum Hamiltonian Computing is a recent approach that uses quantum systems, in particular a single molecule, to perform computational tasks. Within this approach, we present explicit methods to construct logic gates using two different…
The implementation of holonomic quantum computation on superconducting quantum circuits is challenging due to the general requirement of controllable complicated coupling between multilevel systems. Here we solve this problem by proposing a…
Geometric quantum computation is the idea that geometric phases can be used to implement quantum gates, i.e., the basic elements of the Boolean network that forms a quantum computer. Although originally thought to be limited to adiabatic…
We implement a non-adiabatic universal set of holonomic quantum gates based on abelian holonomies using dynamical invariants, by Lie-algebraic methods. Unlike previous implementations, presented scheme does not rely on secondary methods…
A theorem from control theory relating the Lie algebra generated by vector fields on a manifold to the controllability of the dynamical system is shown to apply to Holonomic Quantum Computation. Conditions for deriving the holonomy algebra…
We construct a unified operator framework for quantum holonomies generated from bosonic systems. For a system whose Hamiltonian is bilinear in the creation and annihilation operators, we find a holonomy group determined only by a set of…
A quantum system constrained to a degenerate energy eigenspace can undergo a nontrival time evolution upon adiabatic driving, described by a non-Abelian Berry phase. This type of dynamics may provide logical gates in quantum computing that…
We explore a way of universal quantum computation with particles which cannot occupy the same position simultaneously and are symmetric under exchange of particle labels. Therefore the associated creation and annihilation operators are…
We show that universal holonomic quantum computation (HQC) can be achieved fault-tolerantly by adiabatically deforming the gapped stabilizer Hamiltonian of the surface code, where quantum information is encoded in the degenerate ground…
A quantum walk is a time-homogeneous quantum-mechanical process on a graph defined by analogy to classical random walk. The quantum walker is a particle that moves from a given vertex to adjacent vertices in quantum superposition. Here we…
Nonadiabatic holonomic quantum computation uses non-Abelian geometric phases to implement a universal set of quantum gates that are robust against control imperfections and decoherence. Until now, a number of three-level-based schemes of…
The physical implementation of holonomic quantum computation is challenging due to the needed complex controllable interactions in multilevel quantum systems. Here we propose to implement nonadiabatic holonomic quantum computation with…
Geometric manipulation of a quantum system offers a method for fast, universal, and robust quantum information processing. Here, we propose a scheme for universal all-geometric quantum computation using non-adiabatic quantum holonomies. We…
A periodic change of slow environmental parameters of a quantum system induces quantum holonomy. The phase holonomy is a well-known example. Another is a more exotic kind that exhibits eigenvalue and eigenspace holonomies. We introduce a…
Measurement-based quantum computation (MBQC) and holonomic quantum computation (HQC) are two very different computational methods. The computation in MBQC is driven by adaptive measurements executed in a particular order on a large…
Geometric phases induced in quantum evolutions have built-in noise-resilient characters, and thus can find applications in many robust quantum manipulation tasks. Here, we propose a feasible and fast scheme for universal quantum computation…
Quantum computation has revolutionary potential for speeding algorithms and for simulating quantum systems such as molecules. We report here a quantum computer design that performs universal quantum computation within a single…
We consider quantum computational models defined via a Lie-algebraic theory. In these models, specified initial states are acted on by Lie-algebraic quantum gates and the expectation values of Lie algebra elements are measured at the end.…
It has been shown that a Weyl point in a superconducting nanostructure may give rise to a Weyl disk where two quantum states are almost degenerate in a 2D manifold in the parametric space. This opens up the possibility of a holonomic…