Decoherence mitigation for geometric quantum computation

• URL: http://arxiv.org/abs/2509.03856v1
• Date: Thu, 04 Sep 2025 03:31:50 GMT
• Title: Decoherence mitigation for geometric quantum computation
• Authors: X. Y. Sun, P. Z. Zhao,
• Abstract summary: We propose a scheme of decoherence-mitigated geometric quantum computation based only on physical qubits.<n>Our scheme focuses on the most general interaction between an individual qubit and its environment so that it mitigates not just noise but rather regular decoherence.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Geometric phases depend only on the evolution path determined by the closed circuit in the projective Hilbert space but not on evolution details of the quantum system, leading to geometric quantum computation possessing some intrinsic robustness against control errors. Coordinated with dynamical decoupling, geometric quantum computation admits additional resilience to the environment-induced decoherence. However, the previous schemes of geometric quantum computation protected by dynamical decoupling require multiple physical qubits to encode a logical qubit, which undoubtedly increases the consumption of physical-qubit resources and the difficulty in the implementation of the logical-qubit manipulation based on physical-qubit driving. In this work, we put forward a scheme of decoherence-mitigated geometric quantum computation based only on physical qubits rather than logical qubits, hence avoiding the additional overhead of physical-qubit resources for logical-qubit encoding as well as the difficulty in the manipulation of logical qubits. Moreover, our scheme focuses on the most general interaction between an individual qubit and its environment so that it mitigates not just dephasing noise but rather regular decoherence. Our proposal thus represents a more realistic and effective approach towards the realization of geometric control with decoherence mitigation.

Related papers

• Tensor Network Formulation of Dequantized Algorithms for Ground State Energy Estimation [2.9436347471485558]
  Dequantization algorithms play a central role in providing a clear theoretical framework to separate complexity of quantum and classical algorithms.<n>Existing dequantized algorithms typically rely on sampling procedures, leading to prohibitively large computational overheads.<n>We propose a tensor network-based dequantization framework for GSEE that eliminates the sampling process while preserving the complexity of prior dequantized algorithms.
  arXiv  Detail & Related papers  (2025-12-15T17:07:04Z)
• Time-Aware Qubit Assignment and Circuit Optimization for Distributed Quantum Computing [6.812818096174995]
  In distributed quantum computing, large circuits are divided into smaller subcircuits such that they can be executed individually and simultaneously on multiple QPUs.<n>We address the problem of assigning qubits to QPUs to minimize communication costs in two different ways.<n>First by applying time-aware algorithms that take into account the changing connectivity of a given circuit as well as the underlying network topology.<n>In another approach, we propose an evolutionary-based quantum circuit optimization algorithm that adjusts the circuit itself rather than the schedule to reduce the overall communication cost.
  arXiv  Detail & Related papers  (2025-07-15T20:20:29Z)
• Error-mitigated Geometric Quantum Control over an Oscillator [2.7382619198694886]
  Quantum information is fragile to environmentally and operationally induced imperfections.<n>We propose a robust scheme based on quantum optimal control via functional theory.<n>Our scheme provides a promising alternative for fault-tolerant quantum computation.
  arXiv  Detail & Related papers  (2025-01-24T09:13:24Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• 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)
• Robust nonadiabatic geometric quantum computation by dynamical correction [0.0]
  We propose a robust scheme for nonadiabatic geometric quantum computation (NGQC) combining with the dynamical correction technique. We numerically show that our scheme can greatly improve the gate robustness in previous protocols. Our scheme provides a promising alternation for the future scalable fault-tolerant quantum computation.
  arXiv  Detail & Related papers  (2022-08-02T14:09:48Z)
• Error-Tolerant Geometric Quantum Control for Logical Qubits with Minimal Resource [4.354697470999286]
  We propose a new fast and robust geometric scheme, with the decoherence-free-subspace encoding, and present its physical implementation on superconducting quantum circuits. Our scheme can consolidate both error suppression methods for logical-qubit control, which sheds light on the future large-scale quantum computation.
  arXiv  Detail & Related papers  (2021-12-16T12:10:41Z)
• 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)
• Relaxation times do not capture logical qubit dynamics [50.04886706729045]
  We show that spatial noise correlations can give rise to rich and counter-intuitive dynamical behavior of logical qubits. This work will help to guide and benchmark experimental implementations of logical qubits.
  arXiv  Detail & Related papers  (2020-12-14T19:51:19Z)
• Space-efficient binary optimization for variational computing [68.8204255655161]
  We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem. We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
  arXiv  Detail & Related papers  (2020-09-15T18:17:27Z)
• High-fidelity and Robust Geometric Quantum Gates that Outperform Dynamical Ones [5.781900408390438]
  We propose a general framework of geometric quantum computation with the integration of the time-optimal control technique. Our scheme provides a promising alternative way towards scalable fault-tolerant solid-state quantum computation.
  arXiv  Detail & Related papers  (2020-01-16T13:28: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.