Parallel transport in rotating frames and projective holonomic quantum computation

• URL: http://arxiv.org/abs/2405.20812v3
• Date: Tue, 17 Dec 2024 15:29:47 GMT
• Title: Parallel transport in rotating frames and projective holonomic quantum computation
• Authors: Ole Sönnerborn,
• Abstract summary: We develop a framework for nonadiabatic holonomic quantum computation with projective gates. We extend the isoholonomic inequality, which provides a fundamental bound on the efficiency of protocols used to implement holonomic quantum gates.
• Score: 0.0
• License:
• Abstract: Nonadiabatic holonomic quantum computation is a promising approach for implementing quantum gates that offers both efficiency and robustness against certain types of errors. A key element of this approach is a geometric constraint known as the parallel transport condition. According to the principle of covariance, this condition must be appropriately modified when changing reference frames. In this paper, we detail how to adjust the parallel transport condition when transitioning from the laboratory frame to a rotating reference frame. Furthermore, building on gauge invariance considerations, we develop a framework for nonadiabatic holonomic quantum computation with projective gates. The parallel transport condition of this framework effectively addresses the problem of global dynamical phases inherent in conventional nonadiabatic holonomic quantum computation. We extend the isoholonomic inequality, which provides a fundamental bound on the efficiency of protocols used to implement holonomic quantum gates, to encompass projective quantum gates. We also determine a minimum execution time for projective holonomic quantum gates and show that this time can be attained when the codimension of the computational space is sufficiently large.

Related papers

• Error-mitigated Geometric Quantum Control over an Oscillator [2.7382619198694886]
  Quantum information is fragile to environmental- and operational-induced imperfections. We propose a robust scheme based on quantum optimal control via the functional theory. Our scheme provides a promising alternative for fault-tolerant quantum computation.
  arXiv  Detail & Related papers  (2025-01-24T09:13:24Z)
• The isoholonomic inequality and tight implementations of holonomic quantum gates [0.0]
  In holonomic quantum computation, quantum logic gates are realized by cyclic parallel transport of the computational space. We show that when the codimension of the computational space is sufficiently large, any quantum gate can be implemented using a parallel transporting Hamiltonian.
  arXiv  Detail & Related papers  (2024-12-16T17:39:07Z)
• 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)
• 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)
• Nonadiabatic holonomic quantum computation based on commutation relation [0.0]
  A crucial step in realizing nonadiabatic holonomic quantum computation is to remove the dynamical phase from the total phase. In this paper, we put forward a strategy to design nonadiabatic holonomic quantum computation based on a commutation relation rather than the parallel transport condition.
  arXiv  Detail & Related papers  (2023-08-13T03:30:13Z)
• 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)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• 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)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• 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)
• 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)

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.