Generalized Cross-Entropy Benchmarking for Random Circuits with Ergodicity

• URL: http://arxiv.org/abs/2502.09015v1
• Date: Thu, 13 Feb 2025 07:04:50 GMT
• Title: Generalized Cross-Entropy Benchmarking for Random Circuits with Ergodicity
• Authors: Bin Cheng, Fei Meng, Zhi-Jiong Zhang, Man-Hong Yung,
• Abstract summary: We introduce the concept of ergodicity to random circuit sampling and find that the Haar random quantum circuit satisfies an ergodicity condition.<n>For noise random circuits, we prove that the ergodicity holds fors of degree $t$ with positive coefficients and when the random circuits form a unitary $2t$-design.<n>This suggests that ergodicity is a property that can be exploited to certify a quantum chip.
• Score: 1.457374602200336
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Cross-entropy benchmarking is a central technique used to certify a quantum chip in recent experiments. To better understand its mathematical foundation and develop new benchmarking schemes, we introduce the concept of ergodicity to random circuit sampling and find that the Haar random quantum circuit satisfies an ergodicity condition -- the average of certain types of post-processing function over the output bit strings is close to the average over the unitary ensemble. For noiseless random circuits, we prove that the ergodicity holds for polynomials of degree $t$ with positive coefficients and when the random circuits form a unitary $2t$-design. For strong enough noise, the ergodicity condition is violated. This suggests that ergodicity is a property that can be exploited to certify a quantum chip. We formulate the deviation of ergodicity as a measure for quantum chip benchmarking and show that it can be used to estimate the circuit fidelity for global depolarizing noise and weakly correlated noise. For a quadratic post-processing function, our framework recovers Google's result on estimating the circuit fidelity via linear cross-entropy benchmarking (XEB), and we give a sufficient condition on the noise model characterizing when such estimation is valid. Our results establish an interesting connection between ergodicity and noise in random circuits and provide new insights into designing quantum benchmarking schemes.

Related papers

• Approximation Methods for Simulation and Equivalence Checking of Noisy Quantum Circuits [3.2559508547981917]
  In the current NISQ era, simulating and verifying noisy quantum circuits is crucial. This paper introduces an approximation algorithm for simulating and assessing the equivalence of noisy quantum circuits.
  arXiv  Detail & Related papers  (2025-03-13T13:19:30Z)
• Bayesian Quantum Amplitude Estimation [49.1574468325115]
  We introduce BAE, a noise-aware Bayesian algorithm for quantum amplitude estimation.<n>We show that BAE achieves Heisenberg-limited estimation and benchmark it against other approaches.
  arXiv  Detail & Related papers  (2024-12-05T18:09:41Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Scalable noisy quantum circuits for biased-noise qubits [37.69303106863453]
  We consider biased-noise qubits affected only by bit-flip errors, which is motivated by existing systems of stabilized cat qubits. For realistic noise models, phase-flip will not be negligible, but in the Pauli-Twirling approximation, we show that our benchmark could check the correctness of circuits containing up to $106$ gates.
  arXiv  Detail & Related papers  (2023-05-03T11:27:50Z)
• 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)
• 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)
• 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)
• Benchmarking near-term quantum computers via random circuit sampling [3.48887080077816]
  We develop an algorithm that can sample-efficiently estimate the total amount of noise induced by a layer of arbitrary non-Clifford gates. Our algorithm is inspired by Google's quantum supremacy experiment and is based on random circuit sampling.
  arXiv  Detail & Related papers  (2021-05-11T17:49:16Z)
• Approximate Equivalence Checking of Noisy Quantum Circuits [8.36229449571485]
  We study the problem of equivalence checking in the NISQ (Noisy Intermediate-Scale Quantum) computing realm where quantum noise is present inevitably. The notion of approximate equivalence of (possibly noisy) quantum circuits is defined based on the Jamiolkowski fidelity. We present two algorithms, aiming at different situations where the number of noises varies, for computing the fidelity between an ideal quantum circuit and its noisy implementation.
  arXiv  Detail & Related papers  (2021-03-22T05:47:41Z)
• Mitigating depolarizing noise on quantum computers with noise-estimation circuits [1.3375143521862154]
  We present a method to mitigate the depolarizing noise by first estimating its rate with a noise-estimation circuit. We find that our approach in combination with readout-error correction, compiling, randomized, and zero-noise extrapolation produces results close to exact results even for circuits containing hundreds of CNOT gates.
  arXiv  Detail & Related papers  (2021-03-15T17:59:06Z)
• On the robustness of the hybrid qubit computational gates through simulated randomized benchmarking protocols [0.0]
  Noise characterization can be achieved by exploiting different techniques, such as randomization. A scalable and robust algorithm able to benchmark the full set of Clifford gates is called randomized benchmarking. In this study, we simulated randomized benchmarking protocols in a semiconducting all-electrical three-electron double-quantum dot qubit.
  arXiv  Detail & Related papers  (2020-11-03T09:35:39Z)
• Efficient and robust certification of genuine multipartite entanglement in noisy quantum error correction circuits [58.720142291102135]
  We introduce a conditional witnessing technique to certify genuine multipartite entanglement (GME) We prove that the detection of entanglement in a linear number of bipartitions by a number of measurements scales linearly, suffices to certify GME. We apply our method to the noisy readout of stabilizer operators of the distance-three topological color code and its flag-based fault-tolerant version.
  arXiv  Detail & Related papers  (2020-10-06T18:00:07Z)
• 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)
• 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.