Accelerated super-robust nonadiabatic holonomic quantum gates
- URL: http://arxiv.org/abs/2304.01619v3
- Date: Sun, 1 Oct 2023 04:16:26 GMT
- Title: Accelerated super-robust nonadiabatic holonomic quantum gates
- Authors: Pu Shen, Yan Liang, Tao Chen, and Zheng-Yuan Xue
- Abstract summary: In previous conventional schemes, the states of the calculation subspace have always leaked to the noncomputation subspace.
We propose a solution to the problem without the severe limitation of the much longer gate time.
Our numerical simulations indicate that the decoherence-induced gate errors of our scheme are greatly decreased.
- Score: 4.5867495327952845
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The nonadiabatic holonomic quantum computation based on three-level systems
has wide applicability experimentally due to its simpler energy level structure
requirement and inherent robustness from the geometric phase. However, in
previous conventional schemes, the states of the calculation subspace have
always leaked to the noncomputation subspace, resulting in less robustness than
anticipated. Recent efforts to address this problem are at the cost of
excessively long gate time, which will lead to more decoherence-induced errors.
Here, we propose a solution to the problem without the severe limitation of the
much longer gate time. Specifically, we implement arbitrary holonomic gates via
a three-segment Hamiltonian, where the gate time depends on the rotation angle,
and the smaller the rotation angle, the shorter the gate time will be. Compared
with the previous solutions, our numerical simulations indicate that the
decoherence-induced gate errors of our scheme are greatly decreased and the
robustness of our scheme is also better, particularly for small-angle rotation
gates. Moreover, we provide a detailed physical realization of our proposal on
a two-dimensional superconducting quantum circuit. Therefore, our protocol
provides a promising alternative for future fault-tolerant quantum computation.
Related papers
- Geometric Quantum Machine Learning with Horizontal Quantum Gates [41.912613724593875]
We propose an alternative paradigm for the symmetry-informed construction of variational quantum circuits.
We achieve this by introducing horizontal quantum gates, which only transform the state with respect to the directions to those of the symmetry.
For a particular subclass of horizontal gates based on symmetric spaces, we can obtain efficient circuit decompositions for our gates through the KAK theorem.
arXiv Detail & Related papers (2024-06-06T18:04:39Z) - High-fidelity parallel entangling gates on a neutral atom quantum
computer [41.74498230885008]
We report the realization of two-qubit entangling gates with 99.5% fidelity on up to 60 atoms in parallel.
These advances lay the groundwork for large-scale implementation of quantum algorithms, error-corrected circuits, and digital simulations.
arXiv Detail & Related papers (2023-04-11T18:00:04Z) - Time-optimal universal quantum gates on superconducting circuits [1.5512702032483539]
We propose a scheme to realize universal quantum gates on superconducting qubits in a two-dimensional square lattice configuration.
In order to reduce the influence of the dephasing error, decoherence-free subspace encoding is also incorporated in our physical implementation.
arXiv Detail & Related papers (2023-01-09T13:41:56Z) - Nonadiabatic geometric quantum computation with shortened path on
superconducting circuits [3.0726135239588164]
We present an effective scheme to find the shortest geometric path under the conventional conditions of geometric quantum computation.
High-fidelity and robust geometric gates can be realized by only single-loop evolution.
Our scheme is promising for large-scale fault-tolerant quantum computation.
arXiv Detail & Related papers (2021-11-02T08:03:38Z) - Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems.
By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
arXiv Detail & Related papers (2021-08-03T17:49:09Z) - Ultrafast Holonomic Quantum Gates [4.354697470999286]
We propose a nonadiabatic holonomic quantum scheme with detuned interactions on $Delta$-type three-level system.
Our numerical simulations show that the gate robustness is also stronger than previous schemes.
We present an implementation of our proposal on superconducting quantum circuits, with a decoherence-free subspace encoding.
arXiv Detail & Related papers (2021-08-03T14:31:38Z) - Quantum control landscape for ultrafast generation of single-qubit phase
shift quantum gates [68.8204255655161]
We consider the problem of ultrafast controlled generation of single-qubit phase shift quantum gates.
Globally optimal control is a control which realizes the gate with maximal possible fidelity.
Trap is a control which is optimal only locally but not globally.
arXiv Detail & Related papers (2021-04-26T16:38:43Z) - Noncyclic Geometric Quantum Gates with Smooth Paths via Invariant-based
Shortcuts [4.354697470999286]
We propose a scheme to realize geometric quantum gates with noncyclic and nonadiabatic evolution via invariant-based shortcuts.
Our scheme provides a promising way to realize high-fidelity fault-tolerant quantum gates for scalable quantum computation.
arXiv Detail & Related papers (2021-02-01T15:05:29Z) - Improving the Performance of Deep Quantum Optimization Algorithms with
Continuous Gate Sets [47.00474212574662]
Variational quantum algorithms are believed to be promising for solving computationally hard problems.
In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances.
Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
arXiv Detail & Related papers (2020-05-11T17:20:51Z) - Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling.
We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
arXiv Detail & Related papers (2020-05-05T20:11:53Z) - Robust and Fast Holonomic Quantum Gates with Encoding on Superconducting
Circuits [4.354697470999286]
We propose a simplified implementation of universal holonomic quantum gates on superconducting circuits.
Our scheme is more robust than the conventional ones, and thus provides a promising alternative strategy for scalable fault-tolerant quantum computation.
arXiv Detail & Related papers (2020-04-23T13:26:18Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.