Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1903.04500 · Physical Review A

Universal variational quantum computation

Jacob Biamonte

Published Mar 10, 2021• 100 citations
arXivHTMLPDF

Abstract

The author proves that the contemporary variational approach to quantum-enhanced algorithms enables a universal model of quantum computation. This brings the resources required for universal quantum computation closer to contemporary quantum processors.
DOI
10.1103/physreva.103.l030401

Related papers

On the mathematical structure of quantum models of computation based on Hamiltonian minimisation

Jacob Biamonte

Determining properties of ground states of spin Hamiltonians remains a topic of central relevance connecting disciplines of mathematical, theoretical and applied physics. In the last few decades, ground state properties of physical systems have been increasingly considered as computational resources. This thesis develops parts of the mathematical apparatus to create (program) ground states relevant for quantum and classical computation. The core findings presented in this thesis (now over a decade old) including that (i) logic operations (gates) can be embedded into the low-energy sector of Ising spins whereas three (and higher) body Ising interaction terms can be mimicked through the minimisation of 2- and 1-body Ising terms yet require the introduction of slack spins; (ii) Perturbation theory gadgets enable the emulation of interactions not present in a given Hamiltonian, e.g.~$YY$ interactions can be realized from $ZZ$, $XX$, the thesis contains a result from 2007 showing that physically relevant two-body model Hamiltonian's have a QMA-hard ground state energy decision problem. Merged with other results, this established that these models provide a universal resource for ground state quantum computation. More recent findings include the proof that an idealised version of the contemporary variational approach to quantum algorithms enables a universal model of quantum computation. Other related results are also presented as they relate to ground state quantum computation and the minimisation of Hamiltonians by quantum circuits. The topics covered include: Ising model reductions, stochastic versus quantum processes on graphs, quantum gates and circuits as tensor networks, variational quantum algorithms and Hamiltonian gadgets.

arXiv:2009.10088•Sep 21, 2020•0 citations

An algebraic approach for quantum computation

TranQuoc-Nam, DanielJennifer, AndreevValentin

Quantum computation is one of the very promising new fields of the new millennium for basic research in theoretical computer science and computational mathematics. Quantum computers have stimulated...

Journal of computing sciences in colleges•Oct 1, 2006•0 citations

Quantum Machine Learning and Quantum Algorithms: Hybrid Architectures for Scalable Solutions in Cloud and Mobile-Edge Computing

Prashant D. Sawant

Quantum Machine Learning (QML) represents a transformative intersection of quantum computing and artificial intelligence, promising exponential speed-ups and new capabilities for data-driven tasks. However, the practical realization of QML is hindered by the current limitations of quantum hardware, including scalability constraints, qubit decoherence, and high error rates. Hybrid quantum-classical architectures have emerged as a pragmatic approach, leveraging classical resources alongside quantum processors to mitigate these hardware challenges. A promising direction for advancing QML is the integration of hybrid architectures into cloud computing platforms and mobile-edge environments. This approach enables scalable access to quantum resources, facilitates real-time data processing, and brings quantum-enhanced intelligence closer to end-users and devices. This article reviews the state-of-the-art in QML, focusing on how hybrid models and quantum algorithms are addressing the dual challenges of hardware scalability and architectural integration within cloud and mobile-edge computing contexts. Recent advances are analyzed, benchmark results are highlighted, and future directions for deploying robust, scalable QML systems in distributed computing environments are discussed.

International Journal of Mobile and Cloud Systems Engineering•Jun 30, 2025•0 citations

Pushing the Limits of Quantum Sensing with Variational Quantum Circuits

Patrick J. Coles

Variational quantum algorithms could help researchers improve the performance of optical atomic clocks and of other quantum-metrology schemes.By

Physics•Dec 6, 2021•3 citations

Variational Quantum Computing for Quantum Simulation: Principles, Implementations, and Challenges

Lucas Queiroz Galvão, Anna Beatriz M. de Souza, Marcelo Albano Moret +1 more

arXiv:2510.25449•Brazilian Journal of Physics•Dec 6, 2025•8 citations

Towards quantum utility for NMR quantum simulation on a NISQ computer

Artemiy Burov, Oliver Nagl, Clément Javerzac‐Galy

While the recent demonstration of accurate computations of classically intractable simulations on noisy quantum processors brings quantum advantage closer, there is still the challenge of demonstrating it for practical problems. Here we investigate the application of noisy intermediate-scale quantum devices for simulating nuclear magnetic resonance (NMR) experiments in the high-field regime. In this work, the NMR interactions are mapped to a quantum device via a product formula with minimal resource overhead, an approach that we discuss in detail. Using this approach, we show the results of simulations of liquid-state proton NMR spectra on relevant molecules with up to 11 spins, and up to a total of 47 atoms, and compare them with real NMR experiments. Despite current limitations, we show that a similar approach will eventually lead to a case of quantum utility, a scenario where a practically relevant computational problem can be solved by a quantum computer but not by conventional means. We provide an experimental estimation of the amount of quantum resources needed for solving larger instances of the problem with the presented approach. The polynomial scaling we demonstrate on real processors is a foundational step in bringing practical quantum computation closer to reality.

arXiv:2404.17548•Apr 26, 2024•3 citations
Determining properties of ground states of spin Hamiltonians remains a topic of central relevance connecting disciplines of mathematical, theoretical and applied physics. In the last few decades, ground state properties of physical systems have been increasingly considered as computational resources. This thesis develops parts of the mathematical apparatus to create (program) ground states relevant for quantum and classical computation. The core findings presented in this thesis (now over a decade old) including that (i) logic operations (gates) can be embedded into the low-energy sector of Ising spins whereas three (and higher) body Ising interaction terms can be mimicked through the minimisation of 2- and 1-body Ising terms yet require the introduction of slack spins; (ii) Perturbation theory gadgets enable the emulation of interactions not present in a given Hamiltonian, e.g.~YYYYYY interactions can be realized from ZZZZZZ, XXXXXX, the thesis contains a result from 2007 showing that physically relevant two-body model Hamiltonian's have a QMA-hard ground state energy decision problem. Merged with other results, this established that these models provide a universal resource for ground state quantum computation. More recent findings include the proof that an idealised version of the contemporary variational approach to quantum algorithms enables a universal model of quantum computation. Other related results are also presented as they relate to ground state quantum computation and the minimisation of Hamiltonians by quantum circuits. The topics covered include: Ising model reductions, stochastic versus quantum processes on graphs, quantum gates and circuits as tensor networks, variational quantum algorithms and Hamiltonian gadgets.
Quantum Machine Learning (QML) represents a transformative intersection of quantum computing and artificial intelligence, promising exponential speed-ups and new capabilities for data-driven tasks. However, the practical realization of QML is hindered by the current limitations of quantum hardware, including scalability constraints, qubit decoherence, and high error rates. Hybrid quantum-classical architectures have emerged as a pragmatic approach, leveraging classical resources alongside quantum processors to mitigate these hardware challenges. A promising direction for advancing QML is the integration of hybrid architectures into cloud computing platforms and mobile-edge environments. This approach enables scalable access to quantum resources, facilitates real-time data processing, and brings quantum-enhanced intelligence closer to end-users and devices. This article reviews the state-of-the-art in QML, focusing on how hybrid models and quantum algorithms are addressing the dual challenges of hardware scalability and architectural integration within cloud and mobile-edge computing contexts. Recent advances are analyzed, benchmark results are highlighted, and future directions for deploying robust, scalable QML systems in distributed computing environments are discussed.
While the recent demonstration of accurate computations of classically intractable simulations on noisy quantum processors brings quantum advantage closer, there is still the challenge of demonstrating it for practical problems. Here we investigate the application of noisy intermediate-scale quantum devices for simulating nuclear magnetic resonance (NMR) experiments in the high-field regime. In this work, the NMR interactions are mapped to a quantum device via a product formula with minimal resource overhead, an approach that we discuss in detail. Using this approach, we show the results of simulations of liquid-state proton NMR spectra on relevant molecules with up to 11 spins, and up to a total of 47 atoms, and compare them with real NMR experiments. Despite current limitations, we show that a similar approach will eventually lead to a case of quantum utility, a scenario where a practically relevant computational problem can be solved by a quantum computer but not by conventional means. We provide an experimental estimation of the amount of quantum resources needed for solving larger instances of the problem with the presented approach. The polynomial scaling we demonstrate on real processors is a foundational step in bringing practical quantum computation closer to reality.