Free Quantum Computing

• URL: http://arxiv.org/abs/2602.16927v1
• Date: Wed, 18 Feb 2026 22:39:58 GMT
• Title: Free Quantum Computing
• Authors: Jacques Carette, Chris Heunen, Robin Kaarsgaard, Neil J. Ross, Amr Sabry,
• Abstract summary: We develop an axiomatisation of quantum computing that replaces the standard continuous universality postulates with a small number of discrete equations.<n>We also develop a free model that replaces the standard linear-algebraic model with a category-theoretical one.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum computing improves substantially on known classical algorithms for various important problems, but the nature of the relationship between quantum and classical computing is not yet fully understood. This relationship can be clarified by free models, that add to classical computing just enough physical principles to represent quantum computing and no more. Here we develop an axiomatisation of quantum computing that replaces the standard continuous postulates with a small number of discrete equations, as well as a free model that replaces the standard linear-algebraic model with a category-theoretical one. The axioms and model are based on reversible classical computing, isolate quantum advantage in the ability to take certain well-behaved square roots, and link to various quantum computing hardware platforms. This approach allows combinatorial optimisation, including brute force computer search, to optimise quantum computations. The free model may be interpreted as a programming language for quantum computers, that has the same expressivity and computational universality as the standard model, but additionally allows automated verification and reasoning.

Related papers

• Variational quantum and neural quantum states algorithms for the linear complementarity problem [1.2796203864160849]
  Variational quantum algorithms (VQAs) are promising hybrid quantum-classical methods.<n>We present a novel application of the variational quantum linear solver (VQLS) and its classical neural quantum states-based counterpart, the variational neural linear solver (VNLS)<n>We demonstrate using the VNLS that our solver accurately simulates the dynamics of rigid spherical bodies during collision events.
  arXiv  Detail & Related papers  (2025-04-10T22:03:14Z)
• Operationally classical simulation of quantum states [41.94295877935867]
  A classical state-preparation device cannot generate superpositions and hence its emitted states must commute.<n>We show that no such simulation exists, thereby certifying quantum coherence.<n>Our approach is a possible avenue to understand how and to what extent quantum states defy generic models based on classical devices.
  arXiv  Detail & Related papers  (2025-02-03T15:25:03Z)
• When Quantum and Classical Models Disagree: Learning Beyond Minimum Norm Least Square [1.9223856107206057]
  Variational Quantum Circuits (VQCs) are important candidates for useful application of quantum computing.<n>We propose a general theory of quantum advantages for regression problems.<n>We show that it is possible to design quantum models that cannot be classically approximated with good generalization.
  arXiv  Detail & Related papers  (2024-11-07T18:18:38Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Rapidly Achieving Chemical Accuracy with Quantum Computing Enforced Language Model [22.163742052849432]
  QiankunNet-VQE is a transformer based language models enforced with quantum computing to learn and generate quantum states. It has been implemented using up to 12 qubits and attaining an accuracy level competitive with state-of-the-art classical methods.
  arXiv  Detail & Related papers  (2024-05-15T07:50:57Z)
• Towards Quantum Computational Mechanics [1.530480694206666]
  We show how quantum computing can be used to solve representative element volume (RVE) problems in computational homogenisation. Our quantum RVE solver attains exponential acceleration with respect to classical solvers.
  arXiv  Detail & Related papers  (2023-12-06T12:53:02Z)
• Adapting Pre-trained Language Models for Quantum Natural Language Processing [33.86835690434712]
  We show that pre-trained representation can bring 50% to 60% increases to the capacity of end-to-end quantum models. On quantum simulation experiments, the pre-trained representation can bring 50% to 60% increases to the capacity of end-to-end quantum models.
  arXiv  Detail & Related papers  (2023-02-24T14:59:02Z)
• 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)
• Classical surrogates for quantum learning models [0.7734726150561088]
  We introduce the concept of a classical surrogate, a classical model which can be efficiently obtained from a trained quantum learning model. We show that large classes of well-analyzed re-uploading models have a classical surrogate.
  arXiv  Detail & Related papers  (2022-06-23T14:37:02Z)
• An Introduction to Quantum Machine Learning for Engineers [36.18344598412261]
  Quantum machine learning is emerging as a dominant paradigm to program gate-based quantum computers. This book provides a self-contained introduction to quantum machine learning for an audience of engineers with a background in probability and linear algebra.
  arXiv  Detail & Related papers  (2022-05-11T12:10:52Z)
• A prototype of quantum von Neumann architecture [0.0]
  We propose a model of universal quantum computer system, the quantum version of the von Neumann architecture. It uses ebits as elements of the quantum memory unit, and qubits as elements of the quantum control unit and processing unit. Our primary study demonstrates the manifold power of quantum information and paves the way for the creation of quantum computer systems.
  arXiv  Detail & Related papers  (2021-12-17T06:33:31Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Quantum Deformed Neural Networks [83.71196337378022]
  We develop a new quantum neural network layer designed to run efficiently on a quantum computer. It can be simulated on a classical computer when restricted in the way it entangles input states.
  arXiv  Detail & Related papers  (2020-10-21T09:46:12Z)
• 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)
• Programming a quantum computer with quantum instructions [39.994876450026865]
  We use a density matrixiation protocol to execute quantum instructions on quantum data. A fixed sequence of classically-defined gates performs an operation that uniquely depends on an auxiliary quantum instruction state. The utilization of quantum instructions obviates the need for costly tomographic state reconstruction and recompilation.
  arXiv  Detail & Related papers  (2020-01-23T22:43:29Z)

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.