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:1205.1742 · Europhysics Letters (EPL)

Ground-state spin logic

James Daniel Whitfield, Mauro Faccin, Jacob Biamonte

Published Sep 1, 2012• 66 citations
arXivHTMLPDF

Abstract

Designing and optimizing cost functions and energy landscapes is a problem encountered in many fields of science and engineering. These landscapes and cost functions can be embedded and annealed in experimentally controllable spin Hamiltonians. Using an approach based on group theory and symmetries, we examine the embedding of Boolean logic gates into the ground-state subspace of such spin systems. We describe parameterized families of diagonal Hamiltonians and symmetry operations which preserve the ground-state subspace encoding the truth tables of Boolean formulas. The ground-state embeddings of adder circuits are used to illustrate how gates are combined and simplified using symmetry. Our work is relevant for experimental demonstrations of ground-state embeddings found in both classical optimization as well as adiabatic quantum optimization.

DOI
10.1209/0295-5075/99/57004

Related papers

Quantum Hamiltonian Computing protocols for molecular electronics Boolean logic gates

Omid Faizy Namarvar, Olivier Giraud, Bertrand Georgeot +1 more

Abstract Quantum Hamiltonian Computing is a recent approach that uses quantum systems, in particular a single molecule, to perform computational tasks. Within this approach, we present explicit methods to construct logic gates using two different designs, where the logical outputs are encoded either at fixed energy and spatial positioning of the quantum states, or at different energies. We use these results to construct quantum Boolean adders involving a minimal number of quantum states with the two designs. We also establish a matrix algebra giving an analogy between classical Boolean logic gates and quantum ones, and assess the possibilities of both designs for more complex gates.

arXiv:1812.00395•Quantum Science and Technology•May 23, 2019•10 citations

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•1 citation

Optimized Boolean expression embedding in quantum and reversible logic circuits

Zaid Al-Wardi

The quantum and reversible circuits represent a promising replacement of conventional computers in many applications in the future. The transition between conventional computing and this alternative is indeed a huge paradigm shift. During the transition, embedding of conventional Boolean logic functions and expressions within quantum and reversible logic circuits has to be considered, because conventional computing is generally based on Boolean algebra. This embedding comes with a serious drawback of additional increase in the problem complexity represented by additional constant inputs, the so-called ancillary lines. An algorithmic optimization technique is suggested in this paper to reduce the number of these ancillary lines. With this algorithm embedding of Boolean expressions within reversible/quantum circuits comes out with minimal increase in circuit cost and gate count in the optimized circuits.

AIP conference proceedings•Jan 1, 2023•0 citations

Symmetry-protected adiabatic quantum transistors

Dominic J. Williamson, Stephen D. Bartlett

Adiabatic quantum transistors (AQT) allow quantum logic gates to be performed by applying a large field to a quantum many-body system prepared in its ground state, without the need for local control. The basic operation of such a device can be viewed as driving a spin chain from a symmetry-protected (SP) phase to a trivial phase. This perspective offers an avenue to generalize the AQT and to design several improvements. The performance of quantum logic gates is shown to depend only on universal symmetry properties of a SP phase rather than any fine tuning of the Hamiltonian, and it is possible to implement a universal set of logic gates in this way by combining several different types of SP matter. Such SP AQTs are argued to be robust to a range of relevant noise processes.

arXiv:1408.3415•New Journal of Physics•May 14, 2015•11 citations

The mathematics of a quantum Hamiltonian computing half adder Boolean logic gate

Ghassen Dridi, R Julien, Mohamed Hliwa +1 more

The mathematics behind the quantum Hamiltonian computing (QHC) approach of designing Boolean logic gates with a quantum system are given. Using the quantum eigenvalue repulsion effect, the QHC AND, NAND, OR, NOR, XOR, and NXOR Hamiltonian Boolean matrices are constructed. This is applied to the construction of a QHC half adder Hamiltonian matrix requiring only six quantum states to fullfil a half Boolean logical truth table. The QHC design rules open a nano-architectronic way of constructing Boolean logic gates inside a single molecule or atom by atom at the surface of a passivated semi-conductor.

Nanotechnology•Aug 3, 2015•15 citations

Classical and Quantum Computation in Ground States and Beyond

Elizabeth Crosson

In this dissertation we study classical and quantum spin systems with applications to the theory of computation. In particular, we examine computational aspects of these systems beyond their ground states by considering the effects of non-zero temperatures and excited energy states. In the first part we show that universal classical computations can be encoded into equilibrium thermal states of classical spin systems, at sufficiently low temperatures which are independent of the system size. In the second part we explore different strategies for optimization with the quantum adiabatic algorithm, and we show that it is possible to increase the success probability for hard random instances by following the counterintuitive strategy of evolving along the Hamiltonian path more rapidly. In the third part we examine the performance of simulated quantum annealing in finding the minimum of an energy function which contains a high energy barrier, and we provide evidence that simulated quantum annealing inherits some of the advantages of quantum annealing which allow it to pass through the high barrier and minimize the energy function efficiently. In the last part we show that the path-integral quantum Monte Carlo method leads to a provably efficient algorithm for approximating the partition function of any 1D generalized transverse Ising spin chain (with position-dependent local fields and frustrated interactions), at temperatures which are independent of the system size.

•Sep 29, 2015•1 citation
Designing and optimizing cost functions and energy landscapes is a problem encountered in many fields of science and engineering. These landscapes and cost functions can be embedded and annealed in experimentally controllable spin Hamiltonians. Using an approach based on group theory and symmetries, we examine the embedding of Boolean logic gates into the ground-state subspace of such spin systems. We describe parameterized families of diagonal Hamiltonians and symmetry operations which preserve the ground-state subspace encoding the truth tables of Boolean formulas. The ground-state embeddings of adder circuits are used to illustrate how gates are combined and simplified using symmetry. Our work is relevant for experimental demonstrations of ground-state embeddings found in both classical optimization as well as adiabatic quantum optimization.
Abstract Quantum Hamiltonian Computing is a recent approach that uses quantum systems, in particular a single molecule, to perform computational tasks. Within this approach, we present explicit methods to construct logic gates using two different designs, where the logical outputs are encoded either at fixed energy and spatial positioning of the quantum states, or at different energies. We use these results to construct quantum Boolean adders involving a minimal number of quantum states with the two designs. We also establish a matrix algebra giving an analogy between classical Boolean logic gates and quantum ones, and assess the possibilities of both designs for more complex gates.
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.
The quantum and reversible circuits represent a promising replacement of conventional computers in many applications in the future. The transition between conventional computing and this alternative is indeed a huge paradigm shift. During the transition, embedding of conventional Boolean logic functions and expressions within quantum and reversible logic circuits has to be considered, because conventional computing is generally based on Boolean algebra. This embedding comes with a serious drawback of additional increase in the problem complexity represented by additional constant inputs, the so-called ancillary lines. An algorithmic optimization technique is suggested in this paper to reduce the number of these ancillary lines. With this algorithm embedding of Boolean expressions within reversible/quantum circuits comes out with minimal increase in circuit cost and gate count in the optimized circuits.
Adiabatic quantum transistors (AQT) allow quantum logic gates to be performed by applying a large field to a quantum many-body system prepared in its ground state, without the need for local control. The basic operation of such a device can be viewed as driving a spin chain from a symmetry-protected (SP) phase to a trivial phase. This perspective offers an avenue to generalize the AQT and to design several improvements. The performance of quantum logic gates is shown to depend only on universal symmetry properties of a SP phase rather than any fine tuning of the Hamiltonian, and it is possible to implement a universal set of logic gates in this way by combining several different types of SP matter. Such SP AQTs are argued to be robust to a range of relevant noise processes.
The mathematics behind the quantum Hamiltonian computing (QHC) approach of designing Boolean logic gates with a quantum system are given. Using the quantum eigenvalue repulsion effect, the QHC AND, NAND, OR, NOR, XOR, and NXOR Hamiltonian Boolean matrices are constructed. This is applied to the construction of a QHC half adder Hamiltonian matrix requiring only six quantum states to fullfil a half Boolean logical truth table. The QHC design rules open a nano-architectronic way of constructing Boolean logic gates inside a single molecule or atom by atom at the surface of a passivated semi-conductor.
In this dissertation we study classical and quantum spin systems with applications to the theory of computation. In particular, we examine computational aspects of these systems beyond their ground states by considering the effects of non-zero temperatures and excited energy states. In the first part we show that universal classical computations can be encoded into equilibrium thermal states of classical spin systems, at sufficiently low temperatures which are independent of the system size. In the second part we explore different strategies for optimization with the quantum adiabatic algorithm, and we show that it is possible to increase the success probability for hard random instances by following the counterintuitive strategy of evolving along the Hamiltonian path more rapidly. In the third part we examine the performance of simulated quantum annealing in finding the minimum of an energy function which contains a high energy barrier, and we provide evidence that simulated quantum annealing inherits some of the advantages of quantum annealing which allow it to pass through the high barrier and minimize the energy function efficiently. In the last part we show that the path-integral quantum Monte Carlo method leads to a provably efficient algorithm for approximating the partition function of any 1D generalized transverse Ising spin chain (with position-dependent local fields and frustrated interactions), at temperatures which are independent of the system size.