Related papers: Experimental Realization of Nonadiabatic Holonomic…
This is evident that the controllable quantum systems can be the reliable building blocks for Quantum computation. In reality we are witnessing the progress towards making the idea tractable enough, though optimistic but the threshold is…
We investigate the influence of random errors in external control parameters on the stability of holonomic quantum computation in the case of arbitrary loops and adiabatic connections. A simple expression is obtained for the case of small…
We propose a new variant of the controlled-NOT quantum logic gate based on adiabatic level-crossing dynamics of the q-bits. The gate has a natural implementation in terms of the Cooper pair transport in arrays of small Josephson tunnel…
A crucial requirement for scalable quantum-information processing is the realization of multiple-qubit quantum gates. Universal multiple-qubit gates can be implemented by a set of universal single qubit gates and any one kind of two-qubit…
The non-adiabatic geometric quantum computation (NGQC) has attracted a lot of attention for noise-resilient quantum control. However, previous implementations of NGQC require long evolution paths that make them more vulnerable to incoherent…
We propose an all-geometric implementation of quantum computation using neutral atoms in cavity QED. We show how to perform generic single- and two-qubit gates, the latter by encoding a two-atom state onto a single, many-level atom. We…
A proposal for applying non-adiabatic geometric phases to quantum computing, called the double-loop method [S.-L. Zhu and Z. D. Wang, Phys. Rev. A {\bf 67}, 022319 (2003)], is demonstrated in a liquid state NMR quantum computer. Using a…
Quantum state manipulation with gates based on geometric phases acquired during cyclic operations promises inherent fault-tolerance and resilience to local fluctuations in the control parameters. Here we create a general non-Abelian and…
Quantum computing employs controllable interactions to perform sequences of logical gates and entire algorithms on quantum registers. This paradigm has been widely explored, e.g., for simulating dynamics of manybody systems by decomposing…
Scalable quantum computation in realistic devices requires that precise control can be implemented efficiently in the presence of decoherence and operational errors. We propose a general constructive procedure for designing robust unitary…
Geometric phase, associated with holonomy transformation in quantum state space, is an important quantum-mechanical effect. Besides fundamental interest, this effect has practical applications, among which geometric quantum computation is a…
Each year, the gap between theoretical proposals and experimental endeavours to create quantum computers gets smaller, driven by the promise of fundamentally faster algorithms and quantum simulations. This occurs by the combination of…
Geometric quantum computation relies on the geometric phase that arises in adiabatic cyclic evolutions of non-degenerate quantum systems, enabling the design of robust quantum gates. However, the adiabatic condition requires long evolution…
Fast robust two-qubit gate operation with low susceptibility to crosstalk are the key to scalable quantum information processing. Parametrically driven gate is inherently insensitive to crosstalk while superadiabatic control can speed up…
This is a brief overview of quantum holonomies in the context of quantum computation. We choose an adequate set of quantum logic gates, namely, a phase gate, the Hadamard gate, and a conditional-phase gate and show how they can be…
We show that the notion of generalized Berry phase i.e., non-abelian holonomy, can be used for enabling quantum computation. The computational space is realized by a $n$-fold degenerate eigenspace of a family of Hamiltonians parametrized by…
A geometrical approach to quantum computation is presented, where a non-abelian connection is introduced in order to rewrite the evolution operator of an energy degenerate system as a holonomic unitary. For a simple geometrical model we…
The difficulty in producing precisely timed and controlled quantum gates is a significant source of error in many physical implementations of quantum computers. Here we introduce a simple universal primitive, adiabatic gate teleportation,…
Quantum adiabatic algorithm is of vital importance in quantum computation field. It offers us an alternative approach to manipulate the system instead of quantum gate model. Recently, an interesting work arXiv:1805.10549 indicated that we…
The binomial code is renowned for its parity-mediated loss immunity and loss-error recoverability, while geometric phases are widely recognized for their intrinsic resilience against noise. Capitalizing on their complementary merits, we…