Autonomous Quantum Processing Unit: What does it take to construct a
self-contained model for quantum computation?
- URL: http://arxiv.org/abs/2402.00111v1
- Date: Wed, 31 Jan 2024 19:00:02 GMT
- Title: Autonomous Quantum Processing Unit: What does it take to construct a
self-contained model for quantum computation?
- Authors: Florian Meier, Marcus Huber, Paul Erker, Jake Xuereb
- Abstract summary: A formalism for quantum Turing machines lifts this input-output feature into the quantum domain.
We develop a framework that we dub the autonomous Quantum Processing Unit (aQPU)
Using the theory of open quantum systems we are able to use the aQPU as a formalism to investigate relationships between the thermodynamics, complexity, speed and fidelity of a desired quantum computation.
- Score: 0.27309692684728604
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Computation is an input-output process, where a program encoding a problem to
be solved is inserted into a machine that outputs a solution. Whilst a
formalism for quantum Turing machines which lifts this input-output feature
into the quantum domain has been developed, this is not how quantum computation
is physically conceived. Usually, such a quantum computation is enacted by the
manipulation of macroscopic control interactions according to a program
executed by a classical system. To understand the fundamental limits of
computation, especially in relation to the resources required, it is pivotal to
work with a fully self-contained description of a quantum computation where
computational and thermodynamic resources are not be obscured by the classical
control. To this end, we answer the question; "Can we build a physical model
for quantum computation that is fully autonomous?", i.e., where the program to
be executed as well as the control are both quantum. We do so by developing a
framework that we dub the autonomous Quantum Processing Unit (aQPU). This
machine, consisting of a timekeeping mechanism, instruction register and
computational system allows an agent to input their problem and receive the
solution as an output, autonomously. Using the theory of open quantum systems
and results from the field of quantum clocks we are able to use the aQPU as a
formalism to investigate relationships between the thermodynamics, complexity,
speed and fidelity of a desired quantum computation.
Related papers
- What is computable and non-computable in the quantum domain: 7 statements and 3 conjectures [0.7892577704654171]
There is no universal approach that helps to define a scope of problems that quantum computers are able to speed up.
On the one hand, the class of quantum states that is of interest for quantum computing should be complex.
On the other hand, such quantum states should be reachable on a practical quantum computer.
arXiv Detail & Related papers (2024-03-25T15:47:35Z) - 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) - Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems.
We propose an algorithm to implement imaginary time propagation on a quantum computer.
arXiv Detail & Related papers (2021-02-24T12:48:00Z) - Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor.
We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
arXiv Detail & Related papers (2021-01-21T22:18:49Z) - 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) - Predicting excited states from ground state wavefunction by supervised
quantum machine learning [0.0]
Scheme of supervised quantum machine learning predicts excited-state properties of molecules only from their ground state wavefunction.
Our contribution will enhance the applications of quantum computers in the study of quantum chemistry and quantum materials.
arXiv Detail & Related papers (2020-02-28T18:53:55Z) - Simulating quantum chemistry in the seniority-zero space on qubit-based
quantum computers [0.0]
We combine the so-called seniority-zero, or paired-electron, approximation of computational quantum chemistry with techniques for simulating molecular chemistry on gate-based quantum computers.
We show that using the freed-up quantum resources for increasing the basis set can lead to more accurate results and reductions in the necessary number of quantum computing runs.
arXiv Detail & Related papers (2020-01-31T19:44:37Z) - How Does Adiabatic Quantum Computation Fit into Quantum Automata Theory? [0.0]
Adiabatic evolution of quantum systems have been studied as a potential means that physically realizes quantum computation.
This paper asks a bold question of how to make adiabatic quantum computation fit into the rapidly progressing framework of quantum automata theory.
arXiv Detail & Related papers (2020-01-15T11:29:59Z) - Quantum algorithms for quantum chemistry and quantum materials science [2.867517731896504]
We briefly describe central problems in chemistry and materials science, in areas of electronic structure, quantum statistical mechanics, and quantum dynamics, that are of potential interest for solution on a quantum computer.
We take a detailed snapshot of current progress in quantum algorithms for ground-state, dynamics, and thermal state simulation, and analyze their strengths and weaknesses for future developments.
arXiv Detail & Related papers (2020-01-10T22:49:56Z)
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.