Related papers: Fast binomial-code holonomic quantum computation w…
Holonomic quantum computation is the idea to use non-Abelian geometric phases to implement universal quantum gates that are robust to fluctuations in control parameters. Here, we propose a compact design for a holonomic quantum computer…
In the field of fault-tolerant quantum computing, continuous-variable systems can be utilized to protect quantum information from noise through the use of bosonic codes. These codes map qubit-type quantum information onto the larger bosonic…
Implementing holonomic quantum computation is a challenging task as it requires complicated interaction among multilevel systems. Here we propose to implement nonadiabatic holonomic quantum computation based on dressed-state qubits in…
Non-adiabatic holonomic quantum gate in decoherence-free subspaces is of greatly practical importance due to its built-in fault tolerance, coherence stabilization virtues, and short run-time. Here we propose some compact schemes to…
Reliable quantum information processing requires high-fidelity universal manipulation of quantum systems within the characteristic coherence times. Non-adiabatic holonomic quantum computation offers a promising approach to implement fast,…
We propose a heralded protocol for implementing nontrivial quantum gates on two stationary qubits coupled to spatially separated cavities. By dynamically controlling the evolution of the composite system, nonlocal two-qubit quantum (e.g.,…
We generalize nonadiabatic holonomic quantum computation in a resonant $\Lambda$ configuration proposed in [New J. Phys. 14 (2012) 103035] to the case of off-resonant driving lasers. We show that any single-qubit holonomic gate can be…
Bosonic codes offer noise resilience for quantum information processing. Good performance often comes at a price of complex decoding schemes, limiting their practicality. Here, we propose using a Gottesman-Kitaev-Preskill (GKP) code to…
We introduce a class of bosonic quantum error-correcting codes, termed \emph{extended binomial codes}, which generalize the structure of one-mode binomial codes by incorporating ideas from high-rate qubit stabilizer codes. These codes are…
Nonadiabatic holonomic quantum gates are high-speed and robust. Nevertheless, they were found to be more fragile than the adiabatic gates when systematic errors become dominant. Inspired by the dark-path scheme that was used to partially…
Quantum information is vulnerable to environmental noise and experimental imperfections, hindering the reliability of practical quantum information processors. Therefore, quantum error correction (QEC) that can protect quantum information…
Holonomic gates for quantum computation are commonly considered to be robust against certain kinds of parametric noise, the very motivation of this robustness being the geometric character of the transformation achieved in the adiabatic…
Quantum integer factorization is a potential quantum computing solution that may revolutionize cryptography. Nevertheless, a scalable and efficient quantum algorithm for noisy intermediate-scale quantum computers looks far-fetched. We…
Fault-tolerant quantum computation with bosonic qubits often necessitates the use of noisy discrete-variable ancillae. In this work, we establish a comprehensive and practical fault-tolerance framework for such a hybrid system and…
We introduce a construction for protocols for fault-tolerant quantum computing based on code concatenation and transversal gates. These protocols can be interpreted as families of quantum circuits of low-weight stabilizer measurements…
Geometric phases are robust against certain types of local noises, and thus provide a promising way towards high-fidelity quantum gates. However, comparing with the dynamical ones, previous implementations of nonadiabatic geometric quantum…
Quantum processors enable computational speedups for machine learning through parallel manipulation of high-dimensional vectors. Early demonstrations of quantum machine learning have focused on processing information with qubits. In such…
Previous schemes of nonadiabatic holonomic quantum computation were focused mainly on realizing a universal set of elementary gates. Multiqubit controlled gates could be built by decomposing them into a series of the universal gates. In…
Bosonic Gaussian unitaries are fundamental building blocks of central continuous-variable quantum technologies such as quantum-optic interferometry and bosonic error-correction schemes. In this work, we present the first time-efficient…
We report the realization of a nuclear magnetic resonance computer with three quantum bits that simulates an adiabatic quantum optimization algorithm. Adiabatic quantum algorithms offer new insight into how quantum resources can be used to…