Adaptive Quantum Computers: decoding and state preparation

• URL: http://arxiv.org/abs/2509.08718v1
• Date: Wed, 10 Sep 2025 16:13:41 GMT
• Title: Adaptive Quantum Computers: decoding and state preparation
• Authors: Niels M. P. Neumann,
• Abstract summary: This work formalizes a model that describes adaptive quantum computers.<n>We show that adaptive quantum computers are more powerful than standard computers with respect to retrieving information from corrupted digital data.<n>Next, we show how adaptive quantum computations can improve non-adaptive quantum computations when preparing specific quantum states.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Interacting with a standard computer can enhance the capabilities of current quantum computers already today, particularly by offloading certain computations to the standard computer. Quantum computers that interact with standard computers to perform computations are called adaptive quantum computers. This work formalizes a model that describes these adaptive quantum computers. As quantum computers are still under development, this work focuses on computations that terminate after a fixed number of steps, as that makes their implementation likely easier in practice. First, we show that adaptive quantum computers are more powerful than standard computers with respect to the practical problem of retrieving information from corrupted digital data. Standard computers struggle to retrieve such information within a fixed number of computation steps. The proof uses a structure-versus-randomness approach that splits the problem in a structured and a random-like component. The potential of adaptive quantum computations follows from a specific example where information is retrieved from corrupted data. Additionally, adaptive quantum computers can even improve standard computations for this problem that are not constrained by a fixed number of computation steps. Next, we show how adaptive quantum computations can improve non-adaptive quantum computations when preparing specific quantum states. We present efficient adaptive quantum algorithms to prepare the uniform superposition state, the GHZ state, the W-state and the Dicke state. These states are often used in other quantum algorithms, so having efficient routines for preparing them also enhances the efficiency of other algorithms. This work concludes by comparing these adaptive quantum computations with non-adaptive ones, analyzing their performance both theoretically and through quantum hardware implementations.

Related papers

• Quantum Advantage in Resource Estimation [0.0687531213383208]
  We show that an exponential quantum advantage exists in producing numerical resource estimates of larger quantum algorithms by accurately measuring simulation errors.<n>Our results indicate that this method will reduce runtimes of quantum algorithms by approximately three orders of magnitude for one-hundred qubit systems.<n>The methods we propose require relatively few qubits and operations, meaning the next generation of quantum computers could compute simulation errors for classically intractable systems.
  arXiv  Detail & Related papers  (2025-12-01T19:01:04Z)
• Theoretical and experimental analysis of adaptive quantum computers [0.0]
  Fault-tolerant quantum computations require alternating quantum and classical computations.<n>We look at the advantages of adaptive quantum algorithms in realistic scenarios.<n>We find that despite their potential, adaptive quantum algorithms currently do not outperform full quantum algorithms.
  arXiv  Detail & Related papers  (2025-09-08T09:00:09Z)
• Combinatorial Optimization with Quantum Computers [1.199955563466263]
  Quantum computers do computation with a potential advantage over classical computers.<n>A quantum computer can apply the operator to a superposition of binary strings to provide a superposition of binary outputs.<n>A family of quantum machines called quantum annealers are specially designed to solve optimization problems.
  arXiv  Detail & Related papers  (2024-12-20T10:46:18Z)
• QCircuitBench: A Large-Scale Dataset for Benchmarking Quantum Algorithm Design [63.02824918725805]
  Quantum computing is recognized for the significant speedup it offers over classical computing through quantum algorithms.<n>QCircuitBench is the first benchmark dataset designed to evaluate AI's capability in designing and implementing quantum algorithms.
  arXiv  Detail & Related papers  (2024-10-10T14:24:30Z)
• The curse of random quantum data [62.24825255497622]
  We quantify the performances of quantum machine learning in the landscape of quantum data. We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits. Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
  arXiv  Detail & Related papers  (2024-08-19T12:18:07Z)
• The QUATRO Application Suite: Quantum Computing for Models of Human Cognition [49.038807589598285]
  We unlock a new class of applications ripe for quantum computing research -- computational cognitive modeling. We release QUATRO, a collection of quantum computing applications from cognitive models.
  arXiv  Detail & Related papers  (2023-09-01T17:34:53Z)
• Quantum Machine Learning: from physics to software engineering [58.720142291102135]
  We show how classical machine learning approach can help improve the facilities of quantum computers. We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
  arXiv  Detail & Related papers  (2023-01-04T23:37:45Z)
• Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
  We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources. The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
  arXiv  Detail & Related papers  (2022-09-16T02:37:32Z)
• Quantum Computing for Power Flow Algorithms: Testing on real Quantum Computers [0.0]
  This paper goes beyond quantum computing simulations and performs an experimental application of Quantum Computing for power systems on a real quantum computer. We use five different quantum computers, apply the HHL quantum algorithm, and examine the impact of current noisy quantum hardware on the accuracy and speed of an AC power flow algorithm.
  arXiv  Detail & Related papers  (2022-04-29T11:53:16Z)
• Establishing trust in quantum computations [0.0]
  We introduce a technique for measuring the fidelity with which an as-built quantum computer can execute an algorithm. Our technique converts the algorithm's quantum circuits into a set of closely related circuits whose success rates can be efficiently measured.
  arXiv  Detail & Related papers  (2022-04-15T17:44:30Z)
• Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
  This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
  arXiv  Detail & Related papers  (2020-09-02T22:46:47Z)
• An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
  We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem. The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
  arXiv  Detail & Related papers  (2020-05-06T14:18:44Z)

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.