Quantum advantage from effective $200$-qubit holographic random circuit sampling

• URL: http://arxiv.org/abs/2511.05433v1
• Date: Fri, 07 Nov 2025 17:09:30 GMT
• Title: Quantum advantage from effective $200$-qubit holographic random circuit sampling
• Authors: Bingzhi Zhang, Quntao Zhuang,
• Abstract summary: We introduce a holographic random circuit sampling algorithm that substantially increases the sampling complexity.<n>We experimentally demonstrate the effective sampling of up to 200 qubits, with a cross-entropy benchmark fidelity of $0.0593$.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum computers hold the promise of outperforming classical computers in solving certain problems. While large-scale quantum algorithms will require fault-tolerant devices, near-term demonstrations of quantum advantage on existing devices can provide important milestones. Random circuit sampling has emerged as a leading candidate for such demonstrations. However, existing implementations often underutilize circuit depth, limiting the achievable advantage. We introduce a holographic random circuit sampling algorithm that substantially increases the sampling complexity by leveraging repeated interactions and mid-circuit measurements. This approach scales the effective sampling dimension with the circuit depth, ultimately leading to an exponential growth in sampling complexity. With merely 20 physical qubits on IBM quantum devices, we experimentally demonstrate the effective sampling of up to 200 qubits, with a cross-entropy benchmark fidelity of $0.0593$, establishing a new route to scalable quantum advantage through the combined use of spatial and temporal quantum resources.

Related papers

• Multifractality Analysis of Single Qubit Quantum Circuit Outcomes for a Superconducting Quantum Computer [2.893006778402251]
  We present a multifractal analysis of time series data obtained by repeatedly running a single-qubit quantum circuit on IBM superconducting quantum computers.<n>This finding indicates that the temporal fluctuations inherent to quantum circuit outputs are not purely random but exhibit complex scaling properties across multiple time scales.
  arXiv  Detail & Related papers  (2025-12-20T20:03:26Z)
• Pilot-Wave Simulator: Exact Classical Sampling from Ideal and Noisy Quantum Circuits up to Hundreds of Qubits [1.9573380763700712]
  We propose an exact sampling algorithm that integrates tensor network contraction techniques with a Markov process.<n>As a demonstration, we target the challenge of generating samples from ideal and noisy QAOA circuits with up to 476 qubits.
  arXiv  Detail & Related papers  (2025-10-28T09:33:11Z)
• Digital quantum simulation of many-body systems: Making the most of intermediate-scale, noisy quantum computers [51.56484100374058]
  This thesis is centered around simulating quantum dynamics on quantum devices.<n>We present an overview of the most relevant quantum algorithms for quantum dynamics.<n>We identify relevant problems within quantum dynamics that could benefit from quantum simulation in the near future.
  arXiv  Detail & Related papers  (2025-08-29T10:37:19Z)
• Efficient Quantum Circuit Compilation for Near-Term Quantum Advantage [17.38734393793605]
  We propose an approximate method for compiling target quantum circuits into brick-wall layouts.<n>This new circuit design consists of two-qubit CNOT gates that can be directly implemented on real quantum computers.
  arXiv  Detail & Related papers  (2025-01-13T15:04:39Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14: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)
• Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
  We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most. We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
  arXiv  Detail & Related papers  (2022-04-12T19:39:31Z)
• Experimental Quantum Generative Adversarial Networks for Image Generation [93.06926114985761]
  We experimentally achieve the learning and generation of real-world hand-written digit images on a superconducting quantum processor. Our work provides guidance for developing advanced quantum generative models on near-term quantum devices.
  arXiv  Detail & Related papers  (2020-10-13T06:57:17Z)
• Realizing a quantum generative adversarial network using a programmable superconducting processor [17.3986929818418]
  We report an experimental implementation of a quantum generative adversarial network (QGAN) using a programmable superconducting processor. Our implementation is promising to scale up to noisy intermediate-scale quantum devices.
  arXiv  Detail & Related papers  (2020-09-27T12:09:33Z)
• 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)

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.