Gaining confidence on the correct realization of arbitrary quantum computations

• URL: http://arxiv.org/abs/2308.11368v3
• Date: Fri, 08 Aug 2025 10:19:36 GMT
• Title: Gaining confidence on the correct realization of arbitrary quantum computations
• Abstract summary: We present verification protocols to gain confidence in the realization of an arbitrary universal quantum computation.<n>The derivation of the protocols is based on the fact that matchgate computations, which are classically efficiently simulable, become universal if supplemented with additional resources.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present verification protocols to gain confidence in the correct performance of the realization of an arbitrary universal quantum computation. The derivation of the protocols is based on the fact that matchgate computations, which are classically efficiently simulable, become universal if supplemented with additional resources. We combine tools from weak simulation, randomized compiling, and classical statistics to derive verification circuits. These circuits have the property that (i) they strongly resemble the original circuit and (ii) cannot only be classically efficiently simulated in the ideal, i.e. error free, scenario, but also in the realistic situation where errors are present. In fact, in one of the protocols we apply exactly the same circuit as in the original computation, however, to a slightly modified input state.

Related papers

• Resource-Optimal Importance Sampling for Randomized Quantum Algorithms [3.797867929356259]
  We introduce a general framework for applying classical importance sampling to randomized quantum protocols.<n>Given a cost function for running quantum circuits, the proposed approach minimizes a net-cost figure of merit.<n>We extend the framework to scenarios where the quantum computation is subject to errors arising from algorithmic approximations or from physical noise.
  arXiv  Detail & Related papers  (2026-03-13T18:17:33Z)
• Efficient equivalence checking of Clifford-U circuits with shared single-qubit unitaries [5.016480897268685]
  We present an equivalence-checking method for circuits formed by arbitrary single-qubit layers interleaved with Clifford layers.<n>This pattern is common in variational quantum algorithms and Hamiltonian simulation via Trotter decomposition.<n>We prove the existence of an efficient classical algorithm that determines whether a pair of circuits with shared single-qubit layers are equivalent for every possible choice of the shared single-qubit unitaries.
  arXiv  Detail & Related papers  (2026-03-13T06:25:26Z)
• Measuring Uncertainty in Transformer Circuits with Effective Information Consistency [0.0]
  We develop a sheaf/cohomology and causal emergence perspective to Transformer Circuits.<n>EICS combines (i) a normalized sheaf inconsistency computed from local Jacobians and activations, with (ii) a Gaussian EI proxy for circuit-level causal emergence.<n>We provide practical guidance on score interpretation, computational overhead (with fast and exact modes), and a toy sanity-check analysis.
  arXiv  Detail & Related papers  (2025-09-08T18:54:56Z)
• Logical accreditation: a framework for efficient certification of fault-tolerant computations [1.1068280788997429]
  We introduce logical accreditation, a framework for efficiently certifying quantum computations performed on logical qubits.<n>Our protocol is robust against general noise models, far beyond those typically considered in performance analyses of quantum error-correcting codes.
  arXiv  Detail & Related papers  (2025-08-07T15:53:05Z)
• Average-computation benchmarking for local expectation values in digital quantum devices [0.0]
  We introduce a scheme that combines the target computation with variants of it, which, when averaged, allow for classically solvable correlation functions.<n>The variants exactly preserve the circuit architecture and depth, without simplifying the gates into a classically-simulable set.<n>We provide evidence that estimating average-computation expectation values requires running only a limited number of different circuit realizations.
  arXiv  Detail & Related papers  (2025-07-24T18:00:27Z)
• Unified framework for efficiently computable quantum circuits [0.0]
  Quantum circuits consisting of Clifford and matchgates are two classes of circuits that are known to be efficiently simulatable on a classical computer. We introduce a unified framework that shows in a transparent way the special structure that allows these circuits can be efficiently simulatable.
  arXiv  Detail & Related papers  (2024-01-16T08:04:28Z)
• Stabilizer circuit verification [0.0]
  We propose a set of efficient classical algorithms to fully characterize and exhaustively verify stabilizer circuits. We provide an algorithm for checking the equivalence of stabilizer circuits. All of our algorithms provide relations of measurement outcomes among corresponding circuit representations.
  arXiv  Detail & Related papers  (2023-09-15T18:06:17Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Iterative Qubit Coupled Cluster using only Clifford circuits [36.136619420474766]
  An ideal state preparation protocol can be characterized by being easily generated classically. We propose a method that meets these requirements by introducing a variant of the iterative qubit coupled cluster (iQCC) We demonstrate the algorithm's correctness in ground-state simulations and extend our study to complex systems like the titanium-based compound Ti(C5H5)(CH3)3 with a (20, 20) active space.
  arXiv  Detail & Related papers  (2022-11-18T20:31:10Z)
• A Stable, Fast, and Fully Automatic Learning Algorithm for Predictive Coding Networks [65.34977803841007]
  Predictive coding networks are neuroscience-inspired models with roots in both Bayesian statistics and neuroscience. We show how by simply changing the temporal scheduling of the update rule for the synaptic weights leads to an algorithm that is much more efficient and stable than the original one.
  arXiv  Detail & Related papers  (2022-11-16T00:11:04Z)
• The vacuum provides quantum advantage to otherwise simulatable architectures [49.1574468325115]
  We consider a computational model composed of ideal Gottesman-Kitaev-Preskill stabilizer states. We provide an algorithm to calculate the probability density function of the measurement outcomes.
  arXiv  Detail & Related papers  (2022-05-19T18:03:17Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Investigating the Scalability and Biological Plausibility of the Activation Relaxation Algorithm [62.997667081978825]
  Activation Relaxation (AR) algorithm provides a simple and robust approach for approximating the backpropagation of error algorithm. We show that the algorithm can be further simplified and made more biologically plausible by introducing a learnable set of backwards weights. We also investigate whether another biologically implausible assumption of the original AR algorithm -- the frozen feedforward pass -- can be relaxed without damaging performance.
  arXiv  Detail & Related papers  (2020-10-13T08:02:38Z)
• Efficient calculation of gradients in classical simulations of variational quantum algorithms [0.0]
  We present a novel derivation of an emulation strategy to precisely calculate the gradient in O(P) time. Our strategy is very simple, uses only 'apply gate', 'clone state' and 'inner product' primitives. It is compatible with gate parallelisation schemes, and hardware accelerated and distributed simulators.
  arXiv  Detail & Related papers  (2020-09-06T21:39:44Z)
• Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
  Random quantum circuits are commonly viewed as hard to simulate classically. We show that approximate simulation of typical instances is almost as hard as exact simulation. We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
  arXiv  Detail & Related papers  (2019-12-31T19:00:00Z)

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.