Related papers: Super-Robust Nonadiabatic Holonomic Quantum Comput…
Holonomies, arising from non-Abelian geometric transformations of quantum states in Hilbert space, offer a promising way for quantum computation. These holonomies are not commutable and thus can be used for the realization of a universal…
We propose a feasible scheme to achieve holonomic quantum computation in a decoherence-free subspace (DFS) with trapped ions. By the application of appropriate bichromatic laser fields on the designated ions, we are able to construct two…
Nonadiabatic geometric phases are only dependent on the evolution path of a quantum system but independent of the evolution details, and therefore quantum computation based on nonadiabatic geometric phases is robust against control errors.…
High-fidelity logical \emph{T}-gate realization constitutes a core prerequisite for large-scale fault-tolerant quantum computing. However, conventional magic state distillation requires massive physical qubit overhead across successive…
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 quantum computation offers a practical strategy toward robust quantum computation due to its inherently error tolerance. However, the rigorous geometric conditions lead to complex and/or error-disturbed quantum controls,…
I show how to protect adiabatic quantum computation (AQC) against decoherence and certain control errors, using a hybrid methodology involving dynamical decoupling, subsystem and stabilizer codes, and energy gaps. Corresponding error bounds…
Nonadiabatic holonomic quantum computation provides the means to perform fast and robust quantum gates by utilizing the resilience of non-Abelian geometric phases to fluctuations of the path in state space. While the original scheme [New J.…
Decoherence-free subspaces and subsystems (DFS) preserve quantum information by encoding it into symmetry-protected states unaffected by decoherence. An inherent DFS of a given experimental system may not exist; however, through the use of…
A scalable superconducting architecture for adiabatic quantum computers is proposed. The architecture is based on time-independent, nearest-neighbor interqubit couplings: it can handle any problem in the class NP even in the presence of…
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 implemented arbitrary single qubit gates of geometric quantum computing for a three-level system in a single-shot manner. The evolution time of the gate has been minimized by considering the shortest trajectory of the state on the Bloch…
Noisy Intermediate-Scale Quantum Computing (NISQ) has dominated headlines in recent years, with the longer-term vision of Fault-Tolerant Quantum Computation (FTQC) offering significant potential albeit at currently intractable resource…
Nonadiabatic holonomic quantum computation has attracted increasing interest because of its robustness. In this paper, based on the shortcuts to adiabaticity (STA), we propose a scheme to construct a three-qubit nonadiabatic holonomic gate…
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…
Surface codes can protect quantum information stored in qubits from local errors as long as the per-operation error rate is below a certain threshold. Here we propose holonomic surface codes by harnessing the quantum holonomy of the system.…
Universal speeded-up adiabatic geometric quantum computation~(SAGQC) is studied in $\Lambda$-type three-level system with different coupling cases, i.e., time-dependent detuning, large detuning and one-photon resonance couplings,…
We show how a robust high-fidelity universal set of quantum gates can be implemented using a single form of non-adiabatic rapid passage whose parameters are optimized to maximize gate fidelity and reward gate robustness. Each gate in the…
Fault-tolerant quantum computing (FTQC) is essential for achieving large-scale practical quantum computation. Implementing arbitrary FTQC requires the execution of a universal gate set on logical qubits, which is highly challenging.…
We show that universal quantum computation can be concretely made fault-tolerant without mid-circuit measurements. To this end, we introduce a measurement-free deformation protocol of the Bacon-Shor code to realize a logical $\mathit{CCZ}$…