Related papers: Repeat-until-success cubic phase gate for universa…
Quantum circuit synthesis and compilation are critical components in the quantum computing stack, both for contemporary quantum systems, where efficient use of limited resources is essential, as well as for large-scale fault-tolerant…
A possibility of performing the C-NOT gate operation at the ground and the first excited states of two harmonic oscillators interacting via a two-level system subject to complete control is demonstrated. The system resembles Turing machine,…
Simulating physical systems on near-term quantum computers often requires preparing states within constrained subspaces, like those with fixed particle number or spin. We use Lie algebraic techniques to prove that hardware-efficient gates…
Qudit, a high-dimensional quantum system, provides a larger Hilbert space to process the quantum information and has shown remarkable advantages over the qubit counterparts. It is a great challenge to realize the high fidelity universal…
We present an explicit construction of a relativistic quantum computing architecture using a variational quantum circuit approach that is shown to allow for universal quantum computing. The variational quantum circuit consists of tunable…
Continuous-variable (CV) systems have shown remarkable potential for quantum computation, particularly excelling in scalability and error correction through bosonic encoding. Within this framework, the foundational notion of computational…
In a continuous-variable optical system, the Gottesman-Kitaev-Preskill (GKP) qubit is a promising candidate for fault-tolerant quantum computation. To implement non-Clifford operations on GKP qubits, non-Gaussian operations are required. In…
The generation of a logical qubit called the Gottesman-Kitaev-Preskill qubit in an optical traveling wave is a major challenge for realizing large-scale universal fault-tolerant optical quantum computers. Recently, probabilistic generation…
With gate error rates in multiple technologies now below the threshold required for fault-tolerant quantum computation, the major remaining obstacle to useful quantum computation is scaling, a challenge greatly amplified by the huge…
The nonadiabatic holonomic quantum computation based on the geometric phase is robust against the built-in noise and decoherence. In this work, we theoretically propose a scheme to realize nonadiabatic holonomic quantum gates in a surface…
Quantum gates, which are the essential building blocks of quantum computers, are very fragile. Thus, to realize robust quantum gates with high fidelity is the ultimate goal of quantum manipulation. Here, we propose a nonadiabatic geometric…
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.…
We propose a method for implementation of an universal set of one- and two-quantum-bit gates for quantum computation in the system of two coupled electrons with constant non-diagonal exchange interaction. Suppression of the exchange…
The implementation of holonomic quantum computation is meaningful. We can effectively resist local and collective noise in the process of physical implementation by using the advantage of non-Abelian geometric phase. In this paper, we set…
Enhancing the lifetime of qubits with quantum code-based memories on different quantum hardware is a significant step towards fault-tolerant quantum computing. We theoretically show that the break-even point, i.e., preserving arbitrary…
This paper provides necessary and sufficient conditions for constructing a universal quantum computer over continuous variables. As an example, it is shown how a universal quantum computer for the amplitudes of the electromagnetic field…
We consider the quantum processor based on a chain of trapped ions to propose an architecture wherein the motional degrees of freedom of trapped ions (position and momentum) could be exploited as the computational Hilbert space. We adopt a…
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…
Using transversal gates is a straightforward and efficient technique for fault-tolerant quantum computing. Since transversal gates alone cannot be computationally universal, they must be combined with other approaches such as magic state…
An enduring challenge in computer science is reducing the runtime required to solve computational problems. Quantum computing has attracted significant attention due to its potential to deliver asymptotically faster solutions to certain…