Digital-Analog-Digital Quantum Supremacy

• URL: http://arxiv.org/abs/2512.07127v1
• Date: Mon, 08 Dec 2025 03:23:36 GMT
• Title: Digital-Analog-Digital Quantum Supremacy
• Abstract summary: We introduce a quantum-supremacy framework for a hybrid digital-analog-digital quantum computing model.<n>Results imply that quantum-supremacy tests are possible on today's quantum annealers.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum supremacy has been explored extensively in gate-model settings. Here, we introduce a quantum-supremacy framework for a hybrid digital-analog-digital quantum computing (DADQC) model. We consider a device that applies an initial layer of single-qubit gates, a single transverse-field Ising analog block, and a final single-qubit layer before $Z$-basis readout. The analog block approximates $Z$-diagonal Ising evolution, and we prove that the resulting output distribution is within constant total-variation (TV) distance of an Instantaneous Quantum Polynomial-time (IQP) circuit. Our bounds and constructions are established for fully connected as well as bounded-degree hardware graphs, matching a variety of architectures, including trapped-ion, neutral atom, and superconducting platforms. Assuming anticoncentration (which we prove for all-to-all hardware graphs and conjecture for bounded-degree hardware graphs) and an average-case hardness conjecture for the associated complex-temperature Ising partition functions, standard reductions imply that any efficient classical sampler achieving constant TV error collapses the polynomial hierarchy. Our results imply that quantum-supremacy tests are possible on today's quantum annealers, as well as other devices capable of hybrid digital-analog quantum evolution.

Related papers

• Verifiable quantum advantage in extremely low depth [52.51019642214249]
  We give a problem that is solvable by shallow quantum circuits, hard for computation in time under lattice-based assumptions.<n>We prove that shallow quantum circuits have sufficient structure to solve certain classically hard tasks whose solutions can be verified efficiently.
  arXiv  Detail & Related papers  (2026-09-01T15:54:34Z)
• Quantum circuit design via dynamic Pauli constraints [0.0]
  We introduce a novel software-oriented model of quantum computation motivated by the practical constraints of near-term quantum hardware.<n>Gates are specified by constraints expressed in terms of Pauli observables, with each disjoint layer accompanied by a pairwise or $k$-local quantum state tomography of the device.
  arXiv  Detail & Related papers  (2026-05-21T17:14:16Z)
• SpinGQE: A Generative Quantum Eigensolver for Spin Hamiltonians [42.007194397302825]
  Ground state search is central to quantum computing.<n>We present SpinGQE, an extension of the Generative Quantum Eigensolver framework to spin Hamiltonians.<n>We employ a transformer-based decoder to learn over quantum circuits that produce low-energy states.
  arXiv  Detail & Related papers  (2026-03-25T13:38:15Z)
• Analog-Digital Quantum Computing with Quantum Annealing Processors [0.5799795210728863]
  We show how to perform analog-digital quantum computing in a superconducting quantum annealing processor.<n>This is equivalent to implementing single-qubit gates at the beginning and end of an analog quantum evolution.<n>These experiments open the door to a wide range of new possibilities in quantum computation and simulation.
  arXiv  Detail & Related papers  (2026-03-16T16:58:49Z)
• Designing quantum technologies with a quantum computer [1.4951795042951048]
  We develop a quantum-computer-aided framework for simulating devices using a general electron spin resonance Hamiltonian.<n>Within this model, we combine Gray-encoded qudit-to-qubit mappings, qubit-wise commuting aggregation, and a multi-reference selected quantum Krylov fast-forwarding algorithm.<n> Numerical simulations demonstrate the computation of autocorrelation functions up to $sim100$ ns, together with microwave absorption spectra.<n>We benchmark the framework against classical simulations and identify the reference-state selection in sQKFF as the primary factor governing accuracy at fixed hardware cost.
  arXiv  Detail & Related papers  (2026-01-29T18:26:54Z)
• Convergence of sample-based quantum diagonalization on a variable-length cuprate chain [0.17499351967216337]
  We explore scaling of the algorithm for a variable-length molecule made up of 2 to 6 copper oxide plaquettes with a minimal molecular orbital basis.<n>The results demonstrate that enabling all-to-all connectivity, instituting a higher expansion order for the SQD algorithm, and adopting a non-Hartree-Fock molecular orbital basis can all play significant roles in overcoming sampling bottlenecks.
  arXiv  Detail & Related papers  (2025-12-04T16:30:42Z)
• Realization of Thread Level Parallelism on Quantum Devices [0.052118759008482306]
  We introduce a classical linkage scheme that merges multiple independent quantum processing units (QPUs) into a single logical device.<n>We validate this architecture on clusters comprising up to sixteen benchtop nuclear magnetic resonance (NMR) quantum nodes.<n>Our results demonstrate that classical links suffice to scale up the logical size of quantum computations and realize general, non-unitary channels on today's hardware.
  arXiv  Detail & Related papers  (2025-11-07T17:12:41Z)
• Extending Quantum Perceptrons: Rydberg Devices, Multi-Class Classification, and Error Tolerance [67.77677387243135]
  Quantum Neuromorphic Computing (QNC) merges quantum computation with neural computation to create scalable, noise-resilient algorithms for quantum machine learning (QML) At the core of QNC is the quantum perceptron (QP), which leverages the analog dynamics of interacting qubits to enable universal quantum computation.
  arXiv  Detail & Related papers  (2024-11-13T23:56:20Z)
• Efficient Quantum Pseudorandomness from Hamiltonian Phase States [41.94295877935867]
  We introduce a quantum hardness assumption called the Hamiltonian Phase State (HPS) problem.<n>We show that our assumption is plausibly fully quantum; meaning, it cannot be used to construct one-way functions.<n>We show that our assumption and its variants allow us to efficiently construct many pseudorandom quantum primitives.
  arXiv  Detail & Related papers  (2024-10-10T16:10:10Z)
• Realization of high-fidelity perfect entangler between remote superconducting quantum processors [10.082111942756052]
  Superconducting qubits are a promising candidate for universal quantum computing. Here, we demonstrate high-fidelity perfect entanglers between two remote superconducting quantum devices over 30 cm distance. This advancement significantly enhances the feasibility of universal distributed quantum information processing.
  arXiv  Detail & Related papers  (2024-07-29T18:00:12Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• 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)
• A Comparison of Encoding Techniques for an Analog Quantum Emulation Device [0.0]
  We show an analog quantum emulation device (AQED) where each qubit state is represented by a unique analog signal. We realize the entire device on a UMC 180nm processing node and demonstrate the computational advantage of an AQED.
  arXiv  Detail & Related papers  (2022-11-06T20:14:39Z)
• A trapped ion quantum computer with robust entangling gates and quantum coherent feedback [0.0]
  Chains of ions held in a linear Paul trap are a promising platform for constructing such quantum computers. We report on the construction of a small, five-qubit, universal quantum computer using $88textSr+$ ions in an RF trap.
  arXiv  Detail & Related papers  (2021-11-07T19:17:23Z)
• Tensor Network Quantum Virtual Machine for Simulating Quantum Circuits at Exascale [57.84751206630535]
  We present a modernized version of the Quantum Virtual Machine (TNQVM) which serves as a quantum circuit simulation backend in the e-scale ACCelerator (XACC) framework. The new version is based on the general purpose, scalable network processing library, ExaTN, and provides multiple quantum circuit simulators. By combining the portable XACC quantum processors and the scalable ExaTN backend we introduce an end-to-end virtual development environment which can scale from laptops to future exascale platforms.
  arXiv  Detail & Related papers  (2021-04-21T13:26:42Z)
• Building a fault-tolerant quantum computer using concatenated cat codes [44.03171880260564]
  We present a proposed fault-tolerant quantum computer based on cat codes with outer quantum error-correcting codes. We numerically simulate quantum error correction when the outer code is either a repetition code or a thin rectangular surface code. We find that with around 1,000 superconducting circuit components, one could construct a fault-tolerant quantum computer.
  arXiv  Detail & Related papers  (2020-12-07T23:22:40Z)
• Universal topological quantum computation with strongly correlated Majorana edge modes [7.930410828384357]
  Majorana-based quantum gates are not complete for performing universal topological quantum computation. We show the application to Shor's integer factorization algorithm.
  arXiv  Detail & Related papers  (2020-04-07T12:03:14Z)

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.