Balancing Thermal Relaxation Deviations of Near-Future Quantum Computing Results via Bit-Inverted Programs

• URL: http://arxiv.org/abs/2502.20710v1
• Date: Fri, 28 Feb 2025 04:41:52 GMT
• Title: Balancing Thermal Relaxation Deviations of Near-Future Quantum Computing Results via Bit-Inverted Programs
• Abstract summary: Barber is a method designed to counteract the asymmetric thermal relaxation deviation.<n>It can effectively suppress the thermal relaxation deviation in program's readout results.
• Score: 10.225593486220074
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: One of the predominant causes of program distortion in the real quantum computing system may be attributed to the probability deviation caused by thermal relaxation. We introduce Barber (Balancing reAdout Results using Bit-invErted ciRcuits), a method designed to counteract the asymmetric thermal relaxation deviation and improve the reliability of near-term quantum programs. Barber collaborates with a bit-inverted quantum circuit, where the excited quantum state of qubits is assigned to the $\lvert 0 \rangle$ and the unexcited state to the $\lvert 1 \rangle$. In doing so, bit-inverted quantum circuits can experience thermal relaxation in the opposite direction compared to standard quantum circuits. Barber can effectively suppress the thermal relaxation deviation in program's readout results by selectively merging distributions from the standard and bit-inverted circuits.

Related papers

• Iterative quantum phase estimation with cQED encoding [0.0]
  Quantum phase estimation is a cornerstone algorithm for determining eigenvalues of unitary operators or Hamiltonians.<n>We propose a conceptually simple and experimentally feasible alternative that exploits the toolbox of circuit quantum electrodynamics.<n>A bosonic mode serves as an efficient quantum memory in which the binary digits of the phase are encoded into the direction of phase-space rotations.
  arXiv  Detail & Related papers  (2026-06-20T14:45:05Z)
• Universal Quantum Error Mitigation via Random Inverse Depolarizing Approximation [45.88028371034407]
  We introduce RIDA (Random Inverse Depolarizing Approximation), a simple universal method that harnesses randomly generated circuits to estimate a given circuit's global depolarization probability and corresponding error-free expectation value.<n> Numerical tests indicate RIDA outperforms key benchmarks, suggestive of significant accuracy improvements for applications of quantum computing across fields including physics and chemistry.
  arXiv  Detail & Related papers  (2025-08-24T20:30:08Z)
• Efficient Quantum Gibbs Sampling with Local Circuits [0.2796197251957244]
  We show a way to implement breakthrough algorithms based on the simulation of well-designed dissipative processes.<n>We rigorously prove that the approximations we use have little effect on rapid mixing at high temperatures.<n>Results provide the first provably efficient quantum thermalization protocol implementable on near-term quantum devices.
  arXiv  Detail & Related papers  (2025-06-04T18:00:02Z)
• Quantum Annealing Algorithms for Estimating Ising Partition Functions [2.8311048083168657]
  Estimating partition functions of Ising spin glasses is crucial in statistical physics, optimization, and machine learning. This work bridges quantum dynamics with computational complexity, offering a practical pathway to quantum advantage in spin glass thermodynamics.
  arXiv  Detail & Related papers  (2025-04-30T14:09:40Z)
• Readout Error Mitigation for Mid-Circuit Measurements and Feedforward [0.0]
  Current quantum computing platforms suffer from readout errors, where faulty measurement outcomes are reported by the device.<n>We propose a general protocol for mitigating mid-circuit measurement errors in the presence of feedforward.<n>Our method demonstrates up to a $sim 60%$ reduction in error on superconducting quantum processors.
  arXiv  Detail & Related papers  (2024-06-11T18:00:01Z)
• Quantum Thermal State Preparation [39.91303506884272]
  We introduce simple continuous-time quantum Gibbs samplers for simulating quantum master equations. We construct the first provably accurate and efficient algorithm for preparing certain purified Gibbs states. Our algorithms' costs have a provable dependence on temperature, accuracy, and the mixing time.
  arXiv  Detail & Related papers  (2023-03-31T17:29:56Z)
• Compressed quantum error mitigation [0.0]
  We introduce a quantum error mitigation technique based on probabilistic error cancellation to eliminate errors which have accumulated during the application of a quantum circuit. For a simple noise model, we show that efficient, local denoisers can be found, and we demonstrate their effectiveness for the digital quantum simulation of the time evolution of simple spin chains.
  arXiv  Detail & Related papers  (2023-02-10T19:00:02Z)
• Efficient estimation of trainability for variational quantum circuits [43.028111013960206]
  We find an efficient method to compute the cost function and its variance for a wide class of variational quantum circuits. This method can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem.
  arXiv  Detail & Related papers  (2023-02-09T14:05:18Z)
• Experimental validation of the Kibble-Zurek Mechanism on a Digital Quantum Computer [62.997667081978825]
  The Kibble-Zurek mechanism captures the essential physics of nonequilibrium quantum phase transitions with symmetry breaking. We experimentally tested the KZM for the simplest quantum case, a single qubit under the Landau-Zener evolution. We report on extensive IBM-Q experiments on individual qubits embedded in different circuit environments and topologies.
  arXiv  Detail & Related papers  (2022-08-01T18:00:02Z)
• Probing finite-temperature observables in quantum simulators of spin systems with short-time dynamics [62.997667081978825]
  We show how finite-temperature observables can be obtained with an algorithm motivated from the Jarzynski equality. We show that a finite temperature phase transition in the long-range transverse field Ising model can be characterized in trapped ion quantum simulators.
  arXiv  Detail & Related papers  (2022-06-03T18:00:02Z)
• Characterizing the Reproducibility of Noisy Quantum Circuits [0.40611352512781856]
  We show that device characterization offers an analytic bound on the observed variability of a quantum circuit. We validate the method using an ensemble of single qubit test circuits executed on a superconducting transmon processor with well-characterized readout and gate error rates.
  arXiv  Detail & Related papers  (2022-04-01T05:23:50Z)
• Implementation of a two-stroke quantum heat engine with a collisional model [50.591267188664666]
  We put forth a quantum simulation of a stroboscopic two-stroke thermal engine in the IBMQ processor. The system consists of a quantum spin chain connected to two baths at their boundaries, prepared at different temperatures using the variational quantum thermalizer algorithm.
  arXiv  Detail & Related papers  (2022-03-25T16:55:08Z)
• Fusion-based quantum computation [43.642915252379815]
  Fusion-based quantum computing (FBQC) is a model of universal quantum computation in which entangling measurements, called fusions, are performed on qubits of small constant-sized entangled resource states. We introduce a stabilizer formalism for analyzing fault tolerance and computation in these schemes. This framework naturally captures the error structure that arises in certain physical systems for quantum computing, such as photonics.
  arXiv  Detail & Related papers  (2021-01-22T20:00:22Z)
• Sampling Overhead Analysis of Quantum Error Mitigation: Uncoded vs. Coded Systems [69.33243249411113]
  We show that Pauli errors incur the lowest sampling overhead among a large class of realistic quantum channels. We conceive a scheme amalgamating QEM with quantum channel coding, and analyse its sampling overhead reduction compared to pure QEM.
  arXiv  Detail & Related papers  (2020-12-15T15:51:27Z)
• 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)
• Simulation of Thermal Relaxation in Spin Chemistry Systems on a Quantum Computer Using Inherent Qubit Decoherence [53.20999552522241]
  We seek to take advantage of qubit decoherence as a resource in simulating the behavior of real world quantum systems. We present three methods for implementing the thermal relaxation. We find excellent agreement between our results, experimental data, and the theoretical prediction.
  arXiv  Detail & Related papers  (2020-01-03T11:48:11Z)

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.