Projective holonomic quantum computation
- URL: http://arxiv.org/abs/2405.20812v1
- Date: Fri, 31 May 2024 14:08:55 GMT
- Title: Projective holonomic quantum computation
- Authors: Ole Sönnerborn,
- Abstract summary: We show that a projectivization of the standard gauge theory of nonadiabatic holonomic quantum computation eliminates shortcomings.
We also establish a minimum execution time-a quantum speed limit-for projective holonomic quantum gates.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Nonadiabatic holonomic quantum computing is a novel and promising framework for the implementation and efficient and robust execution of quantum gates based on purely geometric principles. However, the parallel transport condition that is central to nonadiabatic holonomic quantum computing has shortcomings. In this paper, we address some of these shortcomings and show that a projectivization of the standard gauge theory of nonadiabatic holonomic quantum computation eliminates them. In addition, we extend the isoholonomic inequality to projective gates and establish a minimum execution time-a quantum speed limit-for projective holonomic quantum gates.
Related papers
- Estimate of the time required to perform a nonadiabatic holonomic quantum computation [0.0]
Nonadiabatic holonomic quantum computation has been proposed as a method to implement quantum logic gates with robustness comparable to that of adiabatic holonomic gates but with shorter execution times.
We show that the procedures for implementing a universal set of holonomic gates proposed in a pioneering paper on nonadiabatic holonomic quantum computation saturate the isoholonomic inequality and are thus time optimal.
arXiv Detail & Related papers (2024-04-08T20:15:38Z) - Non-adiabatic holonomies as photonic quantum gates [36.136619420474766]
We present the quantum-optical realization of non-adiabatic holonomies that can be used as single-qubit quantum gates.
The inherent non-adiabaticity of the structures paves the way for unprecedented miniaturization.
arXiv Detail & Related papers (2024-01-08T16:44:45Z) - Near-Term Distributed Quantum Computation using Mean-Field Corrections
and Auxiliary Qubits [77.04894470683776]
We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production.
We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
arXiv Detail & Related papers (2023-09-11T18:00:00Z) - Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state.
In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
arXiv Detail & Related papers (2021-12-27T21:15:35Z) - Geometric and holonomic quantum computation [1.4644151041375417]
Quantum gates based on geometric phases and quantum holonomies possess built-in resilience to certain kinds of errors.
This review provides an introduction to the topic as well as gives an overview of the theoretical and experimental progress for constructing geometric and holonomic quantum gates.
arXiv Detail & Related papers (2021-10-07T16:31:54Z) - Universal quantum computation and quantum error correction using
discrete holonomies [0.0]
Holonomic quantum computation exploits a quantum state's non-trivial, matrix-valued geometric phase (holonomy) to perform fault-tolerant computation.
We show that quantum error correction codes integrate naturally in our scheme, providing a model for measurement-based quantum computation.
arXiv Detail & Related papers (2021-09-08T14:55:17Z) - Noncyclic nonadiabatic holonomic quantum gates via shortcuts to
adiabaticity [5.666193021459319]
We propose a fast and robust scheme to construct high-fidelity holonomic quantum gates for universal quantum systems via shortcuts to adiabaticity.
Our scheme is readily realizable in physical system currently pursued for implementation of quantum computation.
arXiv Detail & Related papers (2021-05-28T15:23:24Z) - Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems.
We propose an algorithm to implement imaginary time propagation on a quantum computer.
arXiv Detail & Related papers (2021-02-24T12:48:00Z) - Direct Quantum Communications in the Presence of Realistic Noisy
Entanglement [69.25543534545538]
We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement.
Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
arXiv Detail & Related papers (2020-12-22T13:06:12Z) - 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) - Using Quantum Metrological Bounds in Quantum Error Correction: A Simple
Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates.
Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
arXiv Detail & Related papers (2020-04-24T17:58:10Z)
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.