Ground State Spin Logic

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.

6 pages + 3 pages appendix, 7 figures, 1 table

References in corpus (16)

• Quantum Annealing in the Transverse Ising Model
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Engineered 2D Ising interactions on a trapped-ion quantum simulator with hundreds of spins
• Quantum Annealing and Analog Quantum Computation
• Quantum Annealing: A New Method for Minimizing Multidimensional Functions
• Onset of a Quantum Phase Transition with a Trapped Ion Quantum Simulator
• Experimental Investigation of an Eight Qubit Unit Cell in a Superconducting Optimization Processor
• Anderson localization casts clouds over adiabatic quantum optimization
• On the construction of model Hamiltonians for adiabatic quantum computation and its application to finding low energy conformations of lattice protein models
• Non-perturbative k-body to two-body commuting conversion Hamiltonians and embedding problem instances into Ising spins
• Adiabatic quantum algorithm for search engine ranking
• Does Adiabatic Quantum Optimization Truly Fail for NP-complete problems?
• Adiabatic Quantum Simulators
• More Really is Different
• Encoding Universal Computation in the Ground States of Ising Lattices
• Making Classical Ground State Spin Computing Fault-Tolerant

Cited by in corpus (20)

• Quantum Machine Learning
• Reachability Deficits in Quantum Approximate Optimization
• On the representation of Boolean and real functions as Hamiltonians for quantum computing
• Circuit design for multi-body interactions in superconducting quantum annealing system with applications to a scalable architecture
• Efficient CMOS Invertible Logic Using Stochastic Computing
• Encoding Hypergraphs into Quantum States
• A Direct Mapping of Max k-SAT and High Order Parity Checks to a Chimera Graph
• Graph isomorphism and adiabatic quantum computing
• Tensor Network Contractions for #SAT
• Logical gates embedding in Artificial Spin Ice
• Hamiltonian gadgets with reduced resource requirements
• An Integrated Programming and Development Environment for Adiabatic Quantum Optimization
• Quantum Vertex Model for Reversible Classical Computing
• Amplitude amplification-inspired QAOA: Improving the success probability for solving 3SAT
• On the NP-completeness of the Hartree-Fock method for translationally invariant systems
• High Convergence Rates of CMOS Invertible Logic Circuits Based on Many-Body Hamiltonians
• Quadratic unconstrained binary optimization formulation for rectified-linear-unit-type functions
• Derivation of QUBO formulations for sparse estimation
• Design of General Purpose Minimal-Auxiliary Ising Machines
• In-plane dominant anisotropy stochastic magnetic tunnel junction for probabilistic computing: A Fokker-Planck study