How Far Can You Do Nothing On a Quantum Computer?

• URL: http://arxiv.org/abs/2608.21904v1
• Date: Sat, 22 Aug 2026 10:31:53 GMT
• Title: How Far Can You Do Nothing On a Quantum Computer?
• Abstract summary: We present a route-resolved comparative assessment of Rigetti's Cepheus-1-108Q and IBM Heron-r2 processors.<n>We use this deterministic, low-complexity task as a high-resolution spatial probe.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a route-resolved comparative assessment of Rigetti's Cepheus-1-108Q and IBM Heron-r2 processors using the established 'do-nothing' state-transfer protocol. Rather than proposing a new protocol, we use this deterministic, low-complexity task as a high-resolution spatial probe. For each evaluated initial qubit, we report two complementary quantities: the largest tested radius within which every evaluated shortest route satisfies the operational success rule, and the longest successful route identified within the evaluated route family. To achieve this, we address a deceptively simple yet foundational question: ``How far can you do-nothing on a quantum computer?'' Operationally, this do-nothing protocol serves as a fundamental state transfer protocol: we prepare an initial quantum state, route it across the physical qubits using SWAP gates, and measure the final state fidelity against the well-established classical fidelity limit for single-qubit state transfer. While this trivial state-transfer protocol serves as the most intuitive baseline, actively preserving a quantum state across a physical lattice proves to be a non-trivial task that exposes the information to cumulative relaxation, dephasing, and environmental cross-talk. In the highlighted IBM QPU case, we identify an isotropic radius of 10 and a successful path of swap distance 27, whereas the highlighted Rigetti Cepheus case exhibits an isotropic radius of 1 but selected above-threshold routes reaching swap distance 8. These results reveal a sharp distinction between uniform spatial reliability and best-route performance. The presented quantities are empirical and conditional on the evaluated route families, finite-shot decision rule, calibration state, and execution time; they are not architecture-wide constants.

Related papers

• Approximate Quantum State Preparation Through Proximal Policy Optimization [0.6875312133832078]
  A quantum architecture search framework for approximate quantum state preparation is proposed.<n>The framework is able to achieve approximation errors of $10-14$.
  arXiv  Detail & Related papers  (2026-07-23T09:55:58Z)
• Preparation of Fractional Quantum Hall States on Quantum Computers [9.385433401050015]
  We present a method to precisely prepare the $=1/3$ Laughlin state on the sphere geometry and demonstrate that it significantly reduces the required number of two-qubit gates and circuit depth.<n>Our results provide an efficient and hardware-relevant pathway for realizing generic FQH states on both noisy intermediate-scale and fault-tolerant quantum devices.
  arXiv  Detail & Related papers  (2026-06-15T10:51:19Z)
• A quantum state transfer protocol with Ising Hamiltonians [3.204146202989292]
  We present a protocol for quantum state transfer in linear spin chains tailored to superconducting flux qubits.<n>We adapt it for architectures implementing the transverse-field Ising model by encoding the information in domain walls.<n>The resulting linear Ising chain makes quantum transport experiments accessible to many platforms for analog quantum simulation.
  arXiv  Detail & Related papers  (2025-10-08T19:25:40Z)
• Lattice surgery-based logical state teleportation via noisy links [1.351813974961217]
  We study the correctability phase diagram of the logical state teleportation protocol.<n>We find that the correctability-threshold lines decay as a power law with increasing separation.<n>Our results indicate that the logical state teleportation protocol can tolerate much higher noise rates in the linking region.
  arXiv  Detail & Related papers  (2025-04-22T09:49:03Z)
• Optimal quantum state tomography with local informationally complete measurements [25.33379738135298]
  We study whether a general MPS/MPDO state can be recovered with bounded errors using only a number of state copies in the number of qubits. We provide a positive answer for a variety of common many-body quantum states, including typical short-range entangled states, random MPS/MPDO states, and thermal states of one-dimensional Hamiltonians.
  arXiv  Detail & Related papers  (2024-08-13T17:58:02Z)
• Single-Round Proofs of Quantumness from Knowledge Assumptions [41.94295877935867]
  A proof of quantumness is an efficiently verifiable interactive test that an efficient quantum computer can pass. Existing single-round protocols require large quantum circuits, whereas multi-round ones use smaller circuits but require experimentally challenging mid-circuit measurements. We construct efficient single-round proofs of quantumness based on existing knowledge assumptions.
  arXiv  Detail & Related papers  (2024-05-24T17:33:10Z)
• Realizing the Nishimori transition across the error threshold for constant-depth quantum circuits [0.0]
  We study the generation of the simplest long-range order on a 127 superconducting qubit device. By experimentally tuning coherent and incoherent error rates, we demonstrate stability of this decoded long-range order in two spatial dimensions. Our study exemplifies how measurement-based state preparation can be meaningfully explored on quantum processors beyond a hundred qubits.
  arXiv  Detail & Related papers  (2023-09-06T09:43:12Z)
• Multi-User Entanglement Distribution in Quantum Networks Using Multipath Routing [55.2480439325792]
  We propose three protocols that increase the entanglement rate of multi-user applications by leveraging multipath routing. The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation.
  arXiv  Detail & Related papers  (2023-03-06T18:06:00Z)
• 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)
• Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
  We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
  arXiv  Detail & Related papers  (2022-05-20T12:37:09Z)
• 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)
• Determining ground-state phase diagrams on quantum computers via a generalized application of adiabatic state preparation [61.49303789929307]
  We use a local adiabatic ramp for state preparation to allow us to directly compute ground-state phase diagrams on a quantum computer via time evolution. We are able to calculate an accurate phase diagram on both two and three site systems using IBM quantum machines.
  arXiv  Detail & Related papers  (2021-12-08T23:59:33Z)
• Gaussian conversion protocols for cubic phase state generation [104.23865519192793]
  Universal quantum computing with continuous variables requires non-Gaussian resources. The cubic phase state is a non-Gaussian state whose experimental implementation has so far remained elusive. We introduce two protocols that allow for the conversion of a non-Gaussian state to a cubic phase state.
  arXiv  Detail & Related papers  (2020-07-07T09:19:49Z)

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.