Ising formulations of many NP problems

Abstract

We provide Ising formulations for many NP-complete and NP-hard problems, including all of Karp's 21 NP-complete problems. This collects and extends mappings to the Ising model from partitioning, covering and satisfiability. In each case, the required number of spins is at most cubic in the size of the problem. This work may be useful in designing adiabatic quantum optimization algorithms.

27 pages; v2: substantial revision to intro/conclusion, many more references; v3: substantial revision and extension, to-be-published version

References in corpus (10)

• Quantum annealing with more than one hundred qubits
• Experimental signature of programmable quantum annealing
• Realizable Hamiltonians for Universal Adiabatic Quantum Computers
• A Quantum Adiabatic Algorithm for Factorization and Its Experimental Implementation
• Non-perturbative k-body to two-body commuting conversion Hamiltonians and embedding problem instances into Ising spins
• The performance of the quantum adiabatic algorithm on random instances of two optimization problems on regular hypergraphs
• Spin glass approach to the feedback vertex set problem
• Image recognition with an adiabatic quantum computer I. Mapping to quadratic unconstrained binary optimization
• Adiabatic Quantum Algorithms for the NP-Complete Maximum-Weight Independent Set, Exact Cover and 3SAT Problems
• Robust Classification with Adiabatic Quantum Optimization

Cited by in corpus (814)

• Noisy intermediate-scale quantum (NISQ) algorithms
• Adiabatic Quantum Computing
• Many-Body Physics with Individually-Controlled Rydberg Atoms
• Quantum information processing with superconducting circuits: a review
• Quantum annealing with more than one hundred qubits
• From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
• Quantum optimization using variational algorithms on near-term quantum devices
• Quantum spin dynamics and entanglement generation with hundreds of trapped ions
• Perspectives of quantum annealing: Methods and implementations
• Simulating Lattice Gauge Theories within Quantum Technologies
• Quantum computing with neutral atoms
• Digitized adiabatic quantum computing with a superconducting circuit
• Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
• Quantum Optimization of Maximum Independent Set using Rydberg Atom Arrays
• Physics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer
• A Review on Quantum Approximate Optimization Algorithm and its Variants
• Rydberg atom quantum technologies
• Large-scale photonic Ising machine by spatial light modulation
• Quantum Annealing for Industry Applications: Introduction and Review
• Realizing the $XY$ Hamiltonian in polariton simulators
• Strawberry Fields: A Software Platform for Photonic Quantum Computing
• Warm-starting quantum optimization
• Improving Variational Quantum Optimization using CVaR
• Diagnosing Barren Plateaus with Tools from Quantum Optimal Control
• p-Bits for Probabilistic Spin Logic
• Intrinsic optimization using stochastic nanomagnets
• A case study in programming a quantum annealer for hard operational planning problems
• Massively Parallel Probabilistic Computing with Sparse Ising Machines
• Quantum Optimization of Fully-Connected Spin Glasses
• Combinatorial Optimization with Physics-Inspired Graph Neural Networks
• Error corrected quantum annealing with hundreds of qubits
• Efficient partition of integer optimization problems with one-hot encoding
• Quantum Computing based Hybrid Solution Strategies for Large-scale Discrete-Continuous Optimization Problems
• A Hybrid Solution Method for the Capacitated Vehicle Routing Problem Using a Quantum Annealer
• Challenges and Opportunities in Quantum Optimization
• Photon-Mediated Spin-Exchange Dynamics of Spin-1 Atoms
• A Tutorial on Formulating and Using QUBO Models
• Quantum annealing with a network of all-to-all connected, two-photon driven Kerr nonlinear oscillators
• Optimizing Variational Quantum Algorithms using Pontryagin's Minimum Principle
• Reachability Deficits in Quantum Approximate Optimization
• Solving Vehicle Routing Problem Using Quantum Approximate Optimization Algorithm
• Performance of hybrid quantum/classical variational heuristics for combinatorial optimization
• Application of Quantum Annealing to Nurse Scheduling Problem
• Glassy Chimeras could be blind to quantum speedup: Designing better benchmarks for quantum annealing machines
• Destabilization of local minima in analog spin systems by correction of amplitude heterogeneity
• A full-stack view of probabilistic computing with p-bits: devices, architectures and algorithms
• Filtering variational quantum algorithms for combinatorial optimization
• Quantum optimization with arbitrary connectivity using Rydberg atom arrays
• Nanophotonic spin-glass for realization of a coherent Ising machine
• Demonstration of nanosecond operation in stochastic magnetic tunnel junctions
• Shortcuts to Adiabaticity in Digitized Adiabatic Quantum Computing
• Benchmarking Advantage and D-Wave 2000Q quantum annealers with exact cover problems
• Vertex coloring of graphs via phase dynamics of coupled oscillatory networks
• Counterdiabaticity and the quantum approximate optimization algorithm
• Reverse annealing for the fully connected $p$-spin model
• Quantum Computation Based on Quantum Adiabatic Bifurcations of Kerr-Nonlinear Parametric Oscillators
• Scaling of the quantum approximate optimization algorithm on superconducting qubit based hardware
• Coherent coupled qubits for quantum annealing
• Robust quantum optimizer with full connectivity
• Nonstoquastic Hamiltonians and Quantum Annealing of an Ising Spin Glass
• Probing the Bose-Glass--Superfluid Transition using Quantum Quenches of Disorder
• Improving solutions by embedding larger subproblems in a D-Wave quantum annealer
• Quantum Annealing for Constrained Optimization
• Parameter Transfer for Quantum Approximate Optimization of Weighted MaxCut
• A Coherent Quantum Annealer with Rydberg Atoms
• Spin glass approach to the feedback vertex set problem
• On the representation of Boolean and real functions as Hamiltonians for quantum computing
• Spin order and phase transitions in chains of polariton condensates
• Leveraging Quantum Annealing for Large MIMO Processing in Centralized Radio Access Networks
• A case study of variational quantum algorithms for a job shop scheduling problem
• Classical variational simulation of the Quantum Approximate Optimization Algorithm
• Variational Neural Annealing
• Scaling and diabatic effects in quantum annealing with a D-Wave device
• Implementation of quantum imaginary-time evolution method on NISQ devices: Nonlocal approximation
• Quantum-enhanced Markov chain Monte Carlo
• Applying the Quantum Approximate Optimization Algorithm to the Tail Assignment Problem
• Improved success probability with greater circuit depth for the quantum approximate optimization algorithm
• Exponential Enhancement of the Efficiency of Quantum Annealing by Non-Stochastic Hamiltonians
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets
• Benchmarking Quantum Annealing Controls with Portfolio Optimization
• Best-case performance of quantum annealers on native spin-glass benchmarks: How chaos can affect success probabilities
• Critical Phenomena and Kibble-Zurek Scaling in the Long-Range Quantum Ising Chain
• Engineering Relaxation Pathways in Building Blocks of Artificial Spin Ice for Computation
• A cross-disciplinary introduction to quantum annealing-based algorithms
• Noise-enhanced spatial-photonic Ising machine
• Forecasting financial crashes with quantum computing
• NISQ Computers: A Path to Quantum Supremacy
• Reinforcement Learning assisted Quantum Optimization
• Towards adiabatic quantum computing using compressed quantum circuits
• Benchmark of quantum-inspired heuristic solvers for quadratic unconstrained binary optimization
• Stochastic Thermodynamics of Non-Linear Electronic Circuits: A Realistic Framework for Computing around kT
• Unconstrained Binary Models of the Travelling Salesman Problem Variants for Quantum Optimization
• Autonomous Probabilistic Coprocessing with Petaflips per Second
• Quadratic speedup for spatial search by continuous-time quantum walk
• Quantum Computing Assisted Deep Learning for Fault Detection and Diagnosis in Industrial Process Systems
• Scalable spin-glass optical simulator
• Experimental Observation of Phase Transitions in Spatial Photonic Ising Machine
• Dissipative quantum bifurcation machine: Quantum heating of coupled nonlinear oscillators
• Temperature scaling law for quantum annealing optimizers
• Genome assembly using quantum and quantum-inspired annealing
• Feedback-based quantum optimization
• Benchmarking Discrete Optimization Heuristics with IOHprofiler
• Order-of-magnitude differences in computational performance of analog Ising machines induced by the choice of nonlinearity
• Reverse quantum annealing of the $p$-spin model with relaxation
• Simulating Ising and Potts models and external fields with non-equilibrium condensates
• Error mitigation for variational quantum algorithms through mid-circuit measurements
• Enhancing associative memory recall and storage capacity using confocal cavity QED
• Driver Hamiltonians for constrained optimization in quantum annealing
• Quantum annealing of the $p$-spin model under inhomogeneous transverse field driving
• Efficient encoding of the weighted MAX k-CUT on a quantum computer using QAOA
• Quantum Algorithms for Mixed Binary Optimization applied to Transaction Settlement
• Quantum Computing: Towards Industry Reference Problems
• Experimental quantum annealing: case study involving the graph isomorphism problem
• Protecting Spin Coherence in a Tunable Heisenberg Model
• Benchmarking Hamiltonian Noise in the D-Wave Quantum Annealer
• Item Listing Optimization for E-commerce Websites based on Diversity
• Parallel Quantum Annealing
• Penalty Weights in QUBO Formulations: Permutation Problems
• Improving quantum annealing of the ferromagnetic $p$-spin model through pausing
• Direct observation of a dynamical glass transition in a nanomagnetic artificial Hopfield network
• QUARK: A Framework for Quantum Computing Application Benchmarking
• Quantum simulation of Ising spins on Platonic graphs
• Constrained mixers for the quantum approximate optimization algorithm
• Large-scale Ising Emulation with Four-Body Interaction and All-to-All Connection
• Link Scheduling using Graph Neural Networks
• Tropical Tensor Network for Ground States of Spin Glasses
• Feature Selection for Recommender Systems with Quantum Computing
• Rapid counter-diabatic sweeps in lattice gauge adiabatic quantum computing
• Noise-Resilient Variational Hybrid Quantum-Classical Optimization
• Quantum Optimization for the Graph Coloring Problem with Space-Efficient Embedding
• A quantum walk assisted approximate algorithm for bounded NP optimisation problems
• Digitized-Counterdiabatic Quantum Optimization
• Scalable Emulation of Sign-Problem$-$Free Hamiltonians with Room Temperature p-bits
• A Domain-agnostic, Noise-resistant, Hardware-efficient Evolutionary Variational Quantum Eigensolver
• Programmable Quantum Annealing Architectures with Ising Quantum Wires
• Quantum Shuttle: Traffic Navigation with Quantum Computing
• Oscillator-based Ising Machine
• Unbalanced penalization: A new approach to encode inequality constraints of combinatorial problems for quantum optimization algorithms
• Quantum annealing for the number partitioning problem using a tunable spin glass of ions
• Towards Feature Selection for Ranking and Classification Exploiting Quantum Annealers
• Can nonlinear parametric oscillators solve random Ising models?
• Dicke simulators with emergent collective quantum computational abilities
• Beating classical heuristics for the binary paint shop problem with the quantum approximate optimization algorithm
• Low-rank combinatorial optimization and statistical learning by spatial photonic Ising machine
• Progress toward favorable landscapes in quantum combinatorial optimization
• A Ferroelectric Compute-in-Memory Annealer for Combinatorial Optimization Problems
• Finding spin-glass ground states using quantum walks
• On the optimality of spatial search by continuous-time quantum walk
• Travel time optimization on multi-AGV routing by reverse annealing
• Effective optimization using sample persistence: A case study on quantum annealers and various Monte Carlo optimization methods
• High-accuracy Ising machine using Kerr-nonlinear parametric oscillators with local four-body interactions
• Large-scale quantum approximate optimization on non-planar graphs with machine learning noise mitigation
• Machine Learning Framework for Quantum Sampling of Highly-Constrained, Continuous Optimization Problems
• All-optical scalable spatial coherent Ising machine
• Graph Coloring with Physics-Inspired Graph Neural Networks
• Two-photon driven Kerr resonator for quantum annealing with three-dimensional circuit QED
• Spin many-body phases in standard and topological waveguide QED simulators
• Expectation Values from the Single-Layer Quantum Approximate Optimization Algorithm on Ising Problems
• Application of QUBO solver using black-box optimization to structural design for resonance avoidance
• NP-hard but no longer hard to solve? Using quantum computing to tackle optimization problems
• Comparative study of variations in quantum approximate optimization algorithms for the Traveling Salesman Problem
• Spintronics-compatible approach to solving maximum satisfiability problems with probabilistic computing, invertible logic and parallel tempering
• Controllable Josephson junction for photon Bose-Einstein condensates
• Data-Driven Optimal Sensor Placement for High-Dimensional System Using Annealing Machine
• Benchmark test of Black-box optimization using D-Wave quantum annealer
• Solving large Maximum Clique problems on a quantum annealer
• Antiferromagnetic spatial photonic Ising machine through optoelectronic correlation computing
• Multidimensional hyperspin machine
• Quantum-Informed Recursive Optimization Algorithms
• Efficient Probabilistic Computing with Stochastic Perovskite Nickelates
• Two-parameter counter-diabatic driving in quantum annealing
• Performance of two different quantum annealing correction codes
• Quantitative Evaluation of Hardware Binary Stochastic Neurons
• Scaling Quantum Approximate Optimization on Near-term Hardware
• Quadrature Photonic Spatial Ising Machine
• GPU-accelerated simulations of quantum annealing and the quantum approximate optimization algorithm
• Probing Entanglement in Adiabatic Quantum Optimization with Trapped Ions
• Mean Field Analysis of Quantum Annealing Correction
• An entanglement perspective on the quantum approximate optimization algorithm
• Training Gaussian Boson Sampling Distributions
• Lyapunov control-inspired strategies for quantum combinatorial optimization
• Quantum Approximate Optimization Algorithm with Adaptive Bias Fields
• Analysis of The Vehicle Routing Problem Solved via Hybrid Quantum Algorithms in Presence of Noisy Channels
• Hybrid Approach for Solving Real-World Bin Packing Problem Instances Using Quantum Annealers
• Trainability Enhancement of Parameterized Quantum Circuits via Reduced-Domain Parameter Initialization
• Genetic optimization of quantum annealing
• Efficient sampling of ground and low-energy Ising spin configurations with a coherent Ising machine
• Quantum approximate optimization algorithm for qudit systems
• Simulated bifurcation assisted by thermal fluctuation
• Mapping quantum circuits to modular architectures with QUBO
• Solving optimization problems with Rydberg analog quantum computers: Realistic requirements for quantum advantage using noisy simulation and classical benchmarks
• Comparison of QAOA with Quantum and Simulated Annealing
• Symmetry-enforced many-body separability transitions
• Evidence against a mean field description of short-range spin glasses revealed through thermal boundary conditions
• A dissipative environment may improve the quantum annealing performances of the ferromagnetic p-spin model
• Towards Quantum Belief Propagation for LDPC Decoding in Wireless Networks
• Solving large Minimum Vertex Cover problems on a quantum annealer
• CMOS-compatible Ising and Potts Annealing Using Single Photon Avalanche Diodes
• Constrained quantum annealing of graph coloring
• Charged particle tracking with quantum annealing-inspired optimization
• Variational optimization of the quantum annealing schedule for the Lechner-Hauke-Zoller scheme
• From local to global ground states in Ising spin glasses
• Towards a Linear-Ramp QAOA protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems
• Hybrid Quantum Annealing via Molecular Dynamics
• Simulated bifurcation for higher-order cost functions
• Controlled Online Optimization Learning (COOL): Finding the ground state of spin Hamiltonians with reinforcement learning
• Optimal quantum annealing: A variational shortcut to adiabaticity approach
• Quantum Computational Phase Transition in Combinatorial Problems
• An Alternative Approach to Quantum Imaginary Time Evolution
• Quantum Annealing-Based Software Components: An Experimental Case Study with SAT Solving
• Parity Quantum Optimization: Compiler
• Solving NP-hard problems with bistable polaritonic networks
• An Application of Quantum Annealing Computing to Seismic Inversion
• Solving Larger Maximum Clique Problems Using Parallel Quantum Annealing
• Boosting quantum annealer performance via sample persistence
• Designing Quantum Annealing Schedules using Bayesian Optimization
• Efficient Combinatorial Optimization Using Quantum Annealing
• Nonlinear dynamics and quantum chaos of a family of kicked $p$-spin models
• Applying quantum approximate optimization to the heterogeneous vehicle routing problem
• Direct comparison of quantum and simulated annealing on a fully-connected Ising ferromagnet
• Quantum Computing Techniques for Multi-Knapsack Problems
• Training variational quantum circuits with CoVaR: covariance root finding with classical shadows
• Simulated Quantum Annealing with Two All-to-All Connectivity Schemes
• Scaling Advantage in Approximate Optimization with Quantum Annealing
• Physics-Inspired Heuristics for Soft MIMO Detection in 5G New Radio and Beyond
• Steering random spin systems to speed up the quantum adiabatic algorithm
• Exact Mapping Between a Laser Network Loss Rate and the Classical XY Hamiltonian by Laser Loss Control
• Quadratic and Higher-Order Unconstrained Binary Optimization of Railway Rescheduling for Quantum Computing
• Quantum Genetic Algorithm with Individuals in Multiple Registers
• Analytical solution for nonadiabatic quantum annealing to arbitrary Ising spin Hamiltonian
• Optimizing the spin reversal transform on the D-Wave 2000Q
• Feature Selection for Classification with QAOA
• Harnessing Intrinsic Noise in Memristor Hopfield Neural Networks for Combinatorial Optimization
• Comparing Three Generations of D-Wave Quantum Annealers for Minor Embedded Combinatorial Optimization Problems
• On Circuit Depth Scaling For Quantum Approximate Optimization
• Dynamical phase transitions in the nonreciprocal Ising model
• Quantum Natural Language Processing
• Tight and Efficient Gradient Bounds for Parameterized Quantum Circuits
• Low Rank Non-Negative Matrix Factorization with D-Wave 2000Q
• Evaluating Ising Processing Units with Integer Programming
• An evolving objective function for improved variational quantum optimisation
• On-demand Photonic Ising Machine with Simplified Hamiltonian Calculation by Phase encoding and Intensity Detection
• Quantum-Assisted Solution Paths for the Capacitated Vehicle Routing Problem
• Approaches to Constrained Quantum Approximate Optimization
• Real-time Trading System based on Selections of Potentially Profitable, Uncorrelated, and Balanced Stocks by NP-hard Combinatorial Optimization
• Variational Quantum Algorithms for the Allocation of Resources in a Cloud/Edge Architecture
• 3SAT on an All-to-All-Connected CMOS Ising Solver Chip
• Provable bounds for noise-free expectation values computed from noisy samples
• Advanced anneal paths for improved quantum annealing
• Information processing at the speed of light
• Correlated oscillations in Kerr parametric oscillators with tunable effective coupling
• Limitations of optimization algorithms on noisy quantum devices
• Mean-Field Approximate Optimization Algorithm
• Calibrating the role of entanglement in variational quantum circuits
• Nested Quantum Annealing Correction at Finite Temperature: $p$-spin models
• A symbolic approach to discrete structural optimization using quantum annealing
• Adiabatic Quantum Optimization for Associative Memory Recall
• Approximate optimization, sampling and spin-glass droplets discovery with tensor networks
• An introduction to variational quantum algorithms for combinatorial optimization problems
• Hyperscaling in the coherent hyperspin machine
• Quantum Computing Dataset of Maximum Independent Set Problem on King's Lattice of over Hundred Rydberg Atoms
• Experimental analysis of quantum annealers and hybrid solvers using benchmark optimization problems
• Computational hardness of spin-glass problems with tile-planted solutions
• Not-so-adiabatic quantum computation for the shortest vector problem
• Using Differential Evolution to avoid local minima in Variational Quantum Algorithms
• High finesse bow-tie cavity for strong atom-photon coupling in Rydberg arrays
• Extending relax-and-round combinatorial optimization solvers with quantum correlations
• Multi-spin counter-diabatic driving in many-body quantum Otto refrigerators
• Encoding-Independent Optimization Problem Formulation for Quantum Computing
• Tuneable spin-glass optical simulator based on multiple light scattering
• Effective Bounds on Network-Size for Anti-phase Synchronization
• Quantum Approximate Multi-Objective Optimization
• Ferromagnetically shifting the power of pausing
• Understanding Quantum Tunneling using Diffusion Monte Carlo Simulations
• Guiding Principle for Minor-Embedding in Simulated-Annealing-Based Ising Machines
• Algorithmic QUBO Formulations for k-SAT and Hamiltonian Cycles
• Partitioning Dense Graphs with Hardware Accelerators
• Effective electromagnetic actions for Lorentz violating theories exhibiting the axial anomaly
• Quantum-Inspired Hierarchy for Rank-Constrained Optimization
• Quantum Annealing Algorithms for Boolean Tensor Networks
• Many-body localization enables iterative quantum optimization
• Squeezing and quantum approximate optimization
• Recommending Solution Paths for Solving Optimization Problems with Quantum Computing
• Solving optimization problems with local light shift encoding on Rydberg quantum annealers
• Experimental and Theoretical Study of Thermodynamic Effects in a Quantum Annealer
• Superconducting Quantum Annealing Architecture with LC Resonators
• Parity Quantum Optimization: Benchmarks
• Quantum algorithms for scientific computing
• Solution of SAT Problems with the Adaptive-Bias Quantum Approximate Optimization Algorithm
• Analog Coupled Oscillator Based Weighted Ising Machine
• Solving Quadratic Unconstrained Binary Optimization with divide-and-conquer and quantum algorithms
• Quantum Optimization Methods for Satellite Mission Planning
• A QUBO Formulation for Minimum Loss Spanning Tree Reconfiguration Problems in Electric Power Networks
• Atomic Quantum Technologies for Quantum Matter and Fundamental Physics Applications
• Practical designs for permutation symmetric problem Hamiltonians on hypercubes
• Simulations of Frustrated Ising Hamiltonians with Quantum Approximate Optimization
• Detecting many-body Bell non-locality by solving Ising models
• Focusing on the Hybrid Quantum Computing -- Tabu Search Algorithm: new results on the Asymmetric Salesman Problem
• Observation of Distinct Phase Transitions in a Nonlinear Optical Ising Machine
• Quantum phase transition with inhomogeneous driving in the Lechner-Hauke-Zoller model
• Minor Embedding in Broken Chimera and Pegasus Graphs is NP-complete
• Quantum optics and frontiers of physics: The third quantum revolution
• Solving Boolean satisfiability problems with resistive content addressable memories
• Quantum Annealing for Neural Network optimization problems: a new approach via Tensor Network simulations
• Adiabatic Quantum Optimization Fails to Solve the Knapsack Problem
• Transfer learning of optimal QAOA parameters in combinatorial optimization
• A Quantum N-Queens Solver
• Accelerating Grover Adaptive Search: Qubit and Gate Count Reduction Strategies with Higher-Order Formulations
• Topological Kinetic Crossover in a Nanomagnet Array
• Ability of error correlations to improve the performance of variational quantum algorithms
• Bias-Field Digitized Counterdiabatic Quantum Algorithm for Higher-Order Binary Optimization
• Encoding trade-offs and design toolkits in quantum algorithms for discrete optimization: coloring, routing, scheduling, and other problems
• Variational quantum solutions to the Shortest Vector Problem
• Quantum Computing by Cooling
• Multiobjective variational quantum optimization for constrained problems: an application to Cash Management
• Quantum Programming of the Satisfiability Problem with Rydberg Atom Graphs
• Counterdiabatic Reverse Annealing
• Analogue Quantum Simulation: A New Instrument for Scientific Understanding
• Spatial-photonic Ising machine by space-division multiplexing with physically tunable coefficients of a multi-component model
• Correlation-diversified portfolio construction by finding maximum independent set in large-scale market graph
• Retrieving the ground state of spin glasses using thermal noise: Performance of quantum annealing at finite temperatures
• Solving Multi-Coloring Combinatorial Optimization Problems Using Hybrid Quantum Algorithms
• Rydberg-atom graphs for quadratic unconstrained binary optimization problems
• Entanglement Diagnostics for Efficient Quantum Computation
• PauliComposer: Compute Tensor Products of Pauli Matrices Efficiently
• On computational capabilities of Ising machines based on nonlinear oscillators,
• Parity Quantum Optimization: Encoding Constraints
• ON-OFF Neuromorphic ISING Machines using Fowler-Nordheim Annealers
• Quantum Computing and Tensor Networks for Laminate Design: A Novel Approach to Stacking Sequence Retrieval
• Dynamic-ADAPT-QAOA: An algorithm with shallow and noise-resilient circuits
• Annealing-Assisted Column Generation for Inequality-Constrained Combinatorial Optimization Problems
• Quantum Alternating Operator Ansatz for Solving the Minimum Exact Cover Problem
• Noise Dynamics of Quantum Annealers: Estimating the Effective Noise Using Idle Qubits
• Quantum Isomer Search
• Efficient and Scalable Architecture for Multiple-chip Implementation of Simulated Bifurcation Machines
• Minimal Constraints in the Parity Formulation of Optimization Problems
• Electrically programmable magnetic coupling in an Ising network exploiting solid-state ionic gating
• Supplementing Recurrent Neural Networks with Annealing to Solve Combinatorial Optimization Problems
• Guided quantum walk
• Improving Performance in Combinatorial Optimization Problems with Inequality Constraints: An Evaluation of the Unbalanced Penalization Method on D-Wave Advantage
• An Optimization Case Study for solving a Transport Robot Scheduling Problem on Quantum-Hybrid and Quantum-Inspired Hardware
• Optimizing Variational Quantum Algorithms with qBang: Efficiently Interweaving Metric and Momentum to Navigate Flat Energy Landscapes
• Quantum Approximate Optimization Algorithm for Test Case Optimization
• Customized quantum annealing schedules
• Portfolio rebalancing experiments using the Quantum Alternating Operator Ansatz
• Pairs-trading System using Quantum-inspired Combinatorial Optimization Accelerator for Optimal Path Search in Market Graphs
• Multi-objective QUBO Solver: Bi-objective Quadratic Assignment
• 16-channel Photonic Solver for Optimization Problems on a Silicon Chip
• Quantum computing approach to railway dispatching and conflict management optimization on single-track railway lines
• Solving The Vehicle Routing Problem via Quantum Support Vector Machines
• borealis - A generalized global update algorithm for Boolean optimization problems
• A Benchmarking Study of Quantum Algorithms for Combinatorial Optimization
• Convergence of Digitized-Counterdiabatic QAOA: circuit depth versus free parameters
• Development of Econophysics: A biased account and perspective from Kolkata
• Quantum adiabatic optimization with Rydberg arrays: localization phenomena and encoding strategies
• Symmetry-informed transferability of optimal parameters in the Quantum Approximate Optimization Algorithm
• Grover-QAOA for 3-SAT: Quadratic Speedup, Fair-Sampling, and Parameter Clustering
• Multi-Objective Optimization and Network Routing with Near-Term Quantum Computers
• Initial State Encoding via Reverse Quantum Annealing and h-gain Features
• A Quantum Computing Approach for the Unit Commitment Problem
• Deep learning optimal quantum annealing schedules for random Ising models
• Transit facility allocation: Hybrid quantum-classical optimization
• Deterministic and stochastic sampling of two coupled Kerr parametric oscillators
• Annealing Optimisation of Mixed ZX Phase Circuits
• Solving SAT and MaxSAT with a Quantum Annealer: Foundations, Encodings, and Preliminary Results
• Digitized Counterdiabatic Quantum Algorithms for Logistics Scheduling
• Uplink MIMO Detection using Ising Machines: A Multi-Stage Ising Approach
• Effective spin models of Kerr-nonlinear parametric oscillators for quantum annealing
• Hybrid annealing using a quantum simulator coupled to a classical computer
• Advanced unembedding techniques for quantum annealers
• Leveraging Analog Quantum Computing with Neutral Atoms for Solvent Configuration Prediction in Drug Discovery
• Ising Machines for Diophantine Problems in Physics
• Quantum computing approach to realistic ESG-friendly stock portfolios
• Directly observing replica symmetry breaking in a vector quantum-optical spin glass
• A comparison between D-wave and a classical approximation algorithm and a heuristic for computing the ground state of an Ising spin glass
• Low-depth Clifford circuits approximately solve MaxCut
• Disorder-assisted graph coloring on quantum annealers
• Reweight-annealing method for evaluating the partition function via quantum Monte Carlo calculations
• The coherent Ising machine with quantum feedback: the total and conditional master equation methods
• Cyclic Quantum Annealing: Searching for Deep Low-Energy States in 5000-Qubit Spin Glass
• Dynamical Ginzburg criterion for the quantum-classical crossover of the Kibble-Zurek mechanism
• Semi-supervised time series classification method for quantum computing
• Advantage of pausing: parameter setting for quantum annealers
• A Novel Algebraic Geometry Compiling Framework for Adiabatic Quantum Computations
• Mean-field Coherent Ising Machines with artificial Zeeman terms
• Fast Solving Complete 2000-Node Optimization Using Stochastic-Computing Simulated Annealing
• Exploration of new chemical materials using black-box optimization with the D-wave quantum annealer
• Programmable 200 GOPS Hopfield-inspired photonic Ising machine
• Bias-field digitized counterdiabatic quantum optimization
• Scalable Connectivity for Ising Machines: Dense to Sparse
• Pattern QUBOs: Algorithmic construction of 3SAT-to-QUBO transformations
• Quantum approximate algorithm for NP optimization problems with constraints
• Enhancing VQE Convergence for Optimization Problems with Problem-specific Parameterized Quantum Circuits
• Many-Qudit representation for the Travelling Salesman Problem Optimisation
• Performance enhancement of quantum annealing under the Lechner-Hauke-Zoller scheme by non-linear driving of the constraint term
• Approximating under the Influence of Quantum Noise and Compute Power
• GPU Based Parallel Ising Computing for Combinatorial Optimization Problems in VLSI Physical Design
• Nash embedding and equilibrium in pure quantum states
• Design Optimization of Noise Filter using Quantum Annealer
• Solving Rubik's Cube via Quantum Mechanics and Deep Reinforcement Learning
• Extracting the lifetime of a synthetic two-level system
• Dual-Matrix Domain-Wall: A Novel Technique for Generating Permutations by QUBO and Ising Models with Quadratic Sizes
• Dawn and fall of non-Gaussianity in the quantum parametric oscillator
• Computing Wasserstein Distance for Persistence Diagrams on a Quantum Computer
• Hybrid quantum-classical computation for automatic guided vehicles scheduling
• A Finite-Range Search Formulation of Maximum Likelihood MIMO Detection for Coherent Ising Machines
• Toward Practical Benchmarks of Ising Machines: A Case Study on the Quadratic Knapsack Problem
• A Quantum Algorithm for Model-Independent Searches for New Physics
• Quantum annealing approach to Ionic Diffusion in Solid
• Emulating Quantum Interference with Generalized Ising Machines
• Computing Graph Edit Distance with Algorithms on Quantum Devices
• Hybrid Optimization Method Using Simulated-Annealing-Based Ising Machine and Quantum Annealer
• QCI Qbsolv Delivers Strong Classical Performance for Quantum-Ready Formulation
• Local Energy Distribution Based Hyperparameter Determination for Stochastic Simulated Annealing
• Random coordinate descent: a simple alternative for optimizing parameterized quantum circuits
• Hybrid adiabatic quantum computing for tomographic image reconstruction -- opportunities and limitations
• Feeding the multitude: A polynomial-time algorithm to improve sampling
• Non-Adiabatic Quantum Optimization for Crossing Quantum Phase Transitions
• Quantum optimization within lattice gauge theory model on a quantum simulator
• Quantum-inspired optimization for wavelength assignment
• Accelerating equilibrium spin-glass simulations using quantum annealers via generative deep learning
• Classical simulation of boson sampling with sparse output
• Forbidden subspaces for level-1 QAOA and IQP circuits
• Quantum Chaos and Circuit Parameter Optimization
• Recursive Quantum Relaxation for Combinatorial Optimization Problems
• Beyond Quantum Annealing: Optimal control solutions to MaxCut problems
• Quantum annealing speedup of embedded problems via suppression of Griffiths singularities
• Optimizing Geometry Compression using Quantum Annealing
• Applications and resource reductions in measurement-based variational quantum eigensolvers
• Highly Efficient Encoding for Job-Shop Scheduling Problems and its Application on Quantum Computers
• Qubit-efficient Variational Quantum Algorithms for Image Segmentation
• Using continuation methods to analyse the difficulty of problems solved by Ising machines
• Qudit-inspired optimization for graph coloring
• Highly Versatile FPGA-Implemented Cyber Coherent Ising Machine
• A Hybrid Quantum-Classical Approach to the Electric Mobility Problem
• Quantum Computing for Discrete Optimization: A Highlight of Three Technologies
• Lossy compression of statistical data using quantum annealer
• Efficient quantum and simulated annealing of Potts models using a half-hot constraint
• On the NP-completeness of the Hartree-Fock method for translationally invariant systems
• Theoretical survey of unconventional quantum annealing methods applied to adifficult trial problem
• Enhancing the efficiency of quantum annealing via reinforcement: A path-integral Monte Carlo simulation of the quantum reinforcement algorithm
• On the hardness of quadratic unconstrained binary optimization problems
• Benchmarking Quantum Optimization for the Maximum-Cut Problem on a Superconducting Quantum Computer
• Post-processing variationally scheduled quantum algorithm for constrained combinatorial optimization problems
• Nonvolatile bistable memory and Ising machine based on Micro-Electro-Mechanical Systems
• Breaking RSA Security With A Low Noise D-Wave 2000Q Quantum Annealer: Computational Times, Limitations And Prospects
• OIM: Oscillator-based Ising Machines for Solving Combinatorial Optimisation Problems
• Clustering Method for Time-Series Images Using Quantum-Inspired Computing Technology
• Amplitude amplification-inspired QAOA: Improving the success probability for solving 3SAT
• FragQC: An Efficient Quantum Error Reduction Technique using Quantum Circuit Fragmentation
• Finding Optimal Pathways in Chemical Reaction Networks Using Ising Machines
• Hamiltonian learning for 300 trapped ion qubits with long-range couplings
• Dynamical process of a bit-width reduced Ising model with simulated annealing
• Localization in the constrained quantum annealing of graph coloring
• Simulation of a feedback-based algorithm for quantum optimization for a realistic neutral atom system with an optimized small-angle controlled-phase gate
• Amplitude Amplification for Optimization via Subdivided Phase Oracle
• Quantum Annealing Machine based on Floating Gate Array
• Quantum Chaos in Random Ising Networks
• Verifying the output of quantum optimizers with ground-state energy lower bounds
• PyQUBO: Python Library for Mapping Combinatorial Optimization Problems to QUBO Form
• Demonstration of long-range correlations via susceptibility measurements in a one-dimensional superconducting Josephson spin chain
• Hybrid Algorithm of Linear Programming Relaxation and Quantum Annealing
• Phase-space simulations of feedback coherent Ising machines
• A Comprehensive Cross-Model Framework for Benchmarking the Performance of Quantum Hamiltonian Simulations
• Prog-QAOA: Framework for resource-efficient quantum optimization through classical programs
• Genuine Multipartite Entanglement in Quantum Optimization
• Petri Net Modeling for Ising Model Formulation in Quantum Annealing
• Stochastic Simulated Quantum Annealing for Fast Solution of Combinatorial Optimization Problems
• Efficient Encodings of the Travelling Salesperson Problem for Variational Quantum Algorithms
• Late Breaking Results: New Computational Results and Hardware Prototypes for Oscillator-based Ising Machines
• Approaching Collateral Optimization for NISQ and Quantum-Inspired Computing
• Bounding first-order quantum phase transitions in adiabatic quantum computing
• Quantum Machine Learning and its Supremacy in High Energy Physics
• Quantum-Assisted Joint Virtual Network Function Deployment and Maximum Flow Routing for Space Information Networks
• Multiple Query Optimization on the D-Wave 2X Adiabatic Quantum Computer
• A numerical approach for calculating exact non-adiabatic terms in quantum dynamics
• Quantum computing for genomics: conceptual challenges and practical perspectives
• Quantum annealing with a nonvanishing final value of the transverse field
• Anti-crossings and spectral gap during quantum adiabatic evolution
• A near-term quantum simulation of the transverse field Ising model hints at Glassy Dynamics
• Unraveling Reverse Annealing: A Study of D-Wave Quantum Annealers
• Random Natural Gradient
• QUBO.jl: A Julia Ecosystem for Quadratic Unconstrained Binary Optimization
• Online calibration scheme for training restricted Boltzmann machines with quantum annealing
• Quantum optimization with linear Ising penalty functions for customer data science
• Improving Quantum Approximate Optimization by Noise-Directed Adaptive Remapping
• An approach to solve the coarse-grained Protein folding problem in a Quantum Computer
• Determination of Molecular Energies via Quantum Imaginary Time Evolution in a Superconducting Qubit System
• Noise-tolerant quantum speedups in quantum annealing without fine tuning
• Dynamics of open quantum systems by interpolation of von Neumann and classical master equations, and its application to quantum annealing
• Quantum search in many-body interacting system with long-range interaction
• Digital-Analog Counterdiabatic Quantum Optimization with Trapped Ions
• Optimized QUBO formulation methods for quantum computing
• Modelling noise in global Molmer-Sorensen interactions applied to quantum approximate optimization
• Quantum Annealing Machines Based on Semiconductor Nanostructures
• Projected Entangled Pair States with flexible geometry
• Benchmarking hybrid digitized-counterdiabatic quantum optimization
• Multi-Phase Coupled CMOS Ring Oscillator based Potts Machine
• Two-dimensional Parallel Tempering for Constrained Optimization
• Quantum-assisted finite-element design optimization
• Incentivising Demand Side Response through Discount Scheduling using Hybrid Quantum Optimization
• Mapping NP-hard and NP-complete optimisation problems to Quadratic Unconstrained Binary Optimisation problems
• From quantum-enhanced to quantum-inspired Monte Carlo
• First-quantized adiabatic time evolution for the ground state of a many-electron system and the optimal nuclear configuration
• Dynamic Asset Allocation with Expected Shortfall via Quantum Annealing
• Energy Landscape Structure of Small Graph Isomorphism Under Variational Optimization
• Implementation of spectral methods on Ising machines: toward flow simulations on quantum annealer
• Exact expression of the energy gap at first-order quantum phase transitions of a non-stoquastic Hamiltonian
• Quantum Optimization on Rydberg Atom Arrays with Arbitrary Connectivity: Gadgets Limitations and a Heuristic Approach
• Finding Maximum Cliques on the D-Wave Quantum Annealer
• Scalability Challenges in Variational Quantum Optimization under Stochastic Noise
• pc-COP: An Efficient and Configurable 2048-p-Bit Fully-Connected Probabilistic Computing Accelerator for Combinatorial Optimization
• Fast Hyperparameter Tuning for Ising Machines
• Glass--like transition described by toppling of stability hierarchy
• Difference between quantum annealing by imaginary-time and real-time Schrödinger equation of Grover's search
• Cooperative Multi-Agent Bandits with Heavy Tails
• Performance Models for Split-execution Computing Systems
• Connection between single-layer Quantum Approximate Optimization Algorithm interferometry and thermal distributions sampling
• Exploring the topological sector optimization on quantum computers
• SUANPAN: Scalable Photonic Linear Vector Machine
• Long-range Ising spins models emerging from frustrated Josephson junctions arrays with topological constraints
• A Predictive Approach for Selecting the Best Quantum Solver for an Optimization Problem
• Alleviating the quantum Big-$M$ problem
• Individually tunable tunnelling coefficients in optical lattices using local periodic driving
• Limitations of tensor network approaches for optimization and sampling: A comparison to quantum and classical Ising machines
• Analysis of the shortest vector problems with the quantum annealing to search the excited states
• Compressed space quantum approximate optimization algorithm for constrained combinatorial optimization
• Load Balancing For High Performance Computing Using Quantum Annealing
• Computational Characteristics of Random Field Ising Model with Long-Range Interaction
• Analyzing the Effectiveness of Quantum Annealing with Meta-Learning
• Quantum Annealing based Power Grid Partitioning for Parallel Simulation
• Nonstoquastic catalyst for bifurcation-based quantum annealing of ferromagnetic $p$-spin model
• End-to-End Portfolio Optimization with Quantum Annealing
• Dynamic Optimization on Quantum Hardware: Feasibility for a Process Industry Use Case
• Quantum annealing of Cayley-tree Ising spins at small scales
• Effect of Constraint Relaxation on the Minimum Vertex Cover Problem in Random Graphs
• Nonflat Histogram Techniques for Spin Glasses
• Quantum annealer accelerates the variational quantum eigensolver in a triple-hybrid algorithm
• A general learning scheme for classical and quantum Ising machines
• Graph clustering with Boltzmann machines
• Approximate optimization of MAXCUT with a local spin algorithm
• Quantum Integer Programming (QuIP) 47-779: Lecture Notes
• General Oscillator-Based Ising Machine Models with Phase-Amplitude Dynamics and Polynomial Interactions
• Modeling Linear Inequality Constraints in Quadratic Binary Optimization for Variational Quantum Eigensolver
• Solving Spin Glasses with Optimized Trees of Clustered Spins
• Inductive Construction of Variational Quantum Circuit for Constrained Combinatorial Optimization
• Neural-powered unit disk graph embedding: qubits connectivity for some QUBO problems
• Towards quantum simulation of spin systems using continuous variable quantum devices
• Mixing time and simulated annealing for the stochastic cellular automata
• Computational complexity of three-dimensional Ising spin glass: Lessons from D-Wave annealer
• Equalized Hyperspin Machine
• A QUBO Framework for Team Formation
• Reducing defect production in random transverse-field Ising chains by inhomogeneous driving fields
• Market Graph Clustering Via QUBO and Digital Annealing
• Warm Start Adaptive-Bias Quantum Approximate Optimization Algorithm
• The First Hardware Demonstration of a Universal Programmable RRAM-based Probabilistic Computer for Molecular Docking
• Ground-state magnetization of the Ising spin glass: A recursive numerical method and Chen-Ma scaling
• An optical Ising spin glass simulator with tuneable short range couplings
• Linearizing Binary Optimization Problems Using Variable Posets for Ising Machines
• A thermodynamic approach to optimization in complex quantum systems
• Extending the Q-score to an Application-level Quantum Metric Framework
• Quantum Annealing Learning Search Implementations
• Quantum annealing showing an exponentially small success probability despite a constant energy gap with polynomial energy
• Mapping State Transition Susceptibility in Quantum Annealing
• Entropy Computing, A Paradigm for Optimization in Open Photonic Systems
• Quantum Computing Approach for Energy Optimization in a Prosumer Community
• A Monte Carlo Tree Search approach to QAOA: finding a needle in the haystack
• Optimally generating $\mathfrak{su}(2^N)$ using Pauli strings
• Out of the Loop: Structural Approximation of Optimisation Landscapes and non-Iterative Quantum Optimisation
• QuDASH: Quantum-inspired rate adaptation approach for DASH video streaming
• Exact bounds on the energy gap of transverse-field Ising chains by mapping to random walks
• Survey on Computational Applications of Tensor Network Simulations
• Efficient Optimization of Variational Autoregressive Networks with Natural Gradient
• Post-Error Correction for Quantum Annealing Processor using Reinforcement Learning
• A QUBO formulation for the Tree Containment problem
• Inequality constraints in variational quantum circuits with qudits
• Quantum annealing in the NISQ era: railway conflict management
• Quantum ergodicity and scrambling in quantum annealers
• Boosting quantum annealing performance through direct polynomial unconstrained binary optimization
• Non-binary dynamical Ising machines for combinatorial optimization
• Emergent Equilibrium in All-Optical Single Quantum-Trajectory Ising Machines
• Entanglement-assisted variational algorithm for discrete optimization problems
• Optimization via Quantum Preconditioning
• Improving the efficiency of quantum annealing with controlled diagonal catalysts
• Three Strongly Coupled Kerr Parametric Oscillators Forming a Boltzmann Machine
• Accelerating Feedback-Based Quantum Algorithms through Time Rescaling
• Lagrange Oscillatory Neural Networks for Constraint Satisfaction and Optimization
• Logically Synthesized, Hardware-Accelerated, Restricted Boltzmann Machines for Combinatorial Optimization and Integer Factorization
• Edge-of-chaos enhanced quantum-inspired algorithm for combinatorial optimization
• Higher-Order Portfolio Optimization with Quantum Approximate Optimization Algorithm
• Analysis of the Hopfield Model with Discrete Coupling
• Peering into the Anneal Process of a Quantum Annealer
• Neural optimization for quantum architectures: graph embedding problems with Distance Encoder Networks
• RinQ: Towards predicting central sites in proteins on current quantum computers
• Reverse quantum annealing assisted by forward annealing
• Ising Hamiltonians for Constrained Combinatorial Optimization Problems and the Metropolis-Hastings Warm-Starting Algorithm
• Posiform Planting: Generating QUBO Instances for Benchmarking
• Finding spin glass ground states through deep reinforcement learning
• Excitation dynamics in inductively coupled fluxonium circuits
• Adiabatic evolution on a spatial-photonic Ising machine
• Solving the Optimal Trading Trajectory Problem Using Simulated Bifurcation
• Decoding quantum error correction with Ising model hardware
• Solving tiling puzzles with quantum annealing
• Quadratic Unconstrained Binary Optimization Problem Preprocessing: Theory and Empirical Analysis
• Adiabatic Quantum Computing for Binary Clustering
• Evaluating the Practicality of Quantum Optimization Algorithms for Prototypical Industrial Applications
• Quantum-annealing-inspired algorithms for multijet clustering
• Computing Canonical Averages with Quantum and Classical Optimizers: Thermodynamic Reweighting for QUBO Models of Physical Systems
• Quantum computing and the stable set problem
• The Lie Algebra of XY-mixer Topologies and Warm Starting QAOA for Constrained Optimization
• Hardness-dependent quantum adiabatic schedules for the maximum-independent-set problem
• Asymptotic Exceptional Steady States in Dissipative Dynamics
• Finding optimal solutions by stochastic cellular automata
• Universal Computation with Quantum Fields
• Enhancing In-vehicle Multiple Object Tracking Systems with Embeddable Ising Machines
• Escaping Local Minima with Quantum Coherent Cooling
• Transforming optimization problems into a QUBO form: A tutorial
• Tensor Decompositions and Adiabatic Quantum Computing for Discovering Practical Matrix Multiplication Algorithms
• Iterative classical superadiabatic algorithm for combinatorial optimization
• Unstructured Adiabatic Quantum Optimization: Optimality with Limitations
• Noise-injected analog Ising machines enable ultrafast statistical sampling and machine learning
• Ising formulations of routing optimization problems
• Derivation of QUBO formulations for sparse estimation
• Annealing Dynamics of Regular Rotor Networks: Universality and Its Breakdown
• Graph Clustering Via QUBO and Digital Annealing
• Atom Cavity Encoding for NP-Complete Problems
• SWIFT-FMQA: Enhancing Factorization Machine with Quadratic-Optimization Annealing via Sliding Window
• Any realistic model of a physical system must be computationally realistic
• Efficient QUBO transformation for Higher Degree Pseudo Boolean Functions
• Stochastic light in a cavity: A Brownian particle in a scalar potential?
• Efficient correlation-based discretization of continuous variables for annealing machines
• Optimization of Connection Patterns between Mobile Phones and Base Stations using Quantum Annealing
• Learning-Driven Annealing with Adaptive Hamiltonian Modification for Solving Large-Scale Problems on Quantum Devices
• Parallel Ising Annealer via Gradient-based Hamiltonian Monte Carlo
• Requirements on bit resolution in optical Ising machine implementations
• Mapping NP-Hard Problems to Restricted Adiabatic Quantum Architectures
• Design of General Purpose Minimal-Auxiliary Ising Machines
• Grover's search meets Ising models: a quantum algorithm for finding low-energy states
• Improving quantum annealing by engineering the coupling to the environment
• Minor Embedding for Quantum Annealing with Reinforcement Learning
• The grammar of the Ising model: A new complexity hierarchy
• Estimating the Number of States via the Rodeo Algorithm for Quantum Computation
• Random displacements in critical Rydberg atom arrays
• A scalable 2-local architecture for quantum annealing of Ising models with arbitrary dimensions
• Characterizing the asymmetry in hardness between synthesis and destruction of heteropolymers
• Spin-$S$ Ising models with multispin interactions on the one-dimensional chain and two-dimensional square lattice
• Quantum Optimization Benchmarking Library - The Intractable Decathlon
• IF-QAOA: A Penalty-Free Approach to Accelerating Constrained Quantum Optimization
• Path Matters: Industrial Data Meet Quantum Optimization
• Quantum Hopfield Model with Dilute Memories
• Signatures of quantum chaos and complexity in the Ising model on random graphs
• Quantum Annealing Algorithms for Estimating Ising Partition Functions
• Self-Adaptive Ising Machines for Constrained Optimization
• Graph Coloring via Quantum Optimization on a Rydberg-Qudit Atom Array
• Approximate Quadratization of High-Order Hamiltonians for Combinatorial Quantum Optimization
• Inferring the Dynamics of the State Evolution During Quantum Annealing
• Predict and Conquer: Navigating Algorithm Trade-offs with Quantum Design Automation
• Increasing the Hardness of Posiform Planting Using Random QUBOs for Programmable Quantum Annealer Benchmarking
• It's Quick to be Square: Fast Quadratisation for Quantum Toolchains
• A CMOS-compatible Ising Machine with Bistable Nodes
• Subsampling Factorization Machine Annealing
• Effect of constraint relaxation on dynamic critical phenomena in minimum vertex cover problem
• Improving the convergence of an iterative algorithm for solving arbitrary linear equation systems using classical or quantum binary optimization
• Classical optimization with imaginary time block encoding on quantum computers: The MaxCut problem
• Excited-State Adiabatic Quantum Computation Started with Vacuum States
• Improving Parameter Training for VQEs by Sequential Hamiltonian Assembly
• Quantum-inspired dynamical models on quantum and classical annealers
• Enhancing Multiple Object Tracking Accuracy via Quantum Annealing
• Metrics for spin-based computing
• From Laplacian-to-Adjacency Matrix for Continuous Spins on Graphs
• Population annealing with topological defect driven nonlocal updates for spin systems with quenched disorder
• Minimizing minor embedding energy: an application in quantum annealing
• QUBO Formulations for Variation of Domination Problem
• Quick design of feasible tensor networks for constrained combinatorial optimization
• An encoding of argumentation problems using quadratic unconstrained binary optimization
• Koopman analysis of combinatorial optimization problems with replica exchange Monte Carlo method
• Perpendicular-anisotropy artificial spin ice with spontaneous ordering: a platform for neuromorphic computing with flexible timescales
• Scalable almost-linear dynamical Ising machines
• Hard combinatorial problems and minor embeddings on lattice graphs
• Optimization of Robot Trajectory Planning with Nature-Inspired and Hybrid Quantum Algorithms
• Effect of Quantum Statistics on Computational Power of Atomic Quantum Annealers
• The quantum version of the shifted power method and its application in quadratic binary optimization
• Nonlinear topological symmetry protection in a dissipative system
• Solving combinatorial problems by two D_Wave hybrid solvers: a case study of traveling salesman problems in the TSP Library
• Study of noise in virtual distillation circuits for quantum error mitigation
• A short review on the maximum clique problem algorithms with classical, AI, and quantum methods
• A spatial-photonic Ising machine to solve the two-way number-partitioning problem
• ORQVIZ: Visualizing High-Dimensional Landscapes in Variational Quantum Algorithms
• Modularized and Scalable Compilation for Double Quantum Dot Quatum Computing
• Symmetry-based quantum algorithms for open-shop scheduling with hard constraints
• Hybrid classical-quantum branch-and-bound algorithm for solving integer linear problems
• Solving Inequality-Constrained Binary Optimization Problems on Quantum Annealer
• Distributed Injection-Locking in Analog Ising Machines to Solve Combinatorial Optimizations
• Enhancing Quantum Algorithms for Quadratic Unconstrained Binary Optimization via Integer Programming
• Optimal Sufficient Requirements on the Embedded Ising Problem in Polynomial Time
• Comparing Quantum Annealing and Spiking Neuromorphic Computing for Sampling Binary Sparse Coding QUBO Problems
• QROSS: QUBO Relaxation Parameter Optimisation via Learning Solver Surrogates
• Time-dependent Real-space Renormalization-Group Approach: application to an adiabatic random quantum Ising model
• Characterization of Locality in Spin States and Forced Moves for Optimizations
• Benchmarking Embedded Chain Breaking in Quantum Annealing
• Maritime Just-in-time navigation with Quantum algorithms
• Graph Distances and Clustering
• The Holy Grail of Quantum Artificial Intelligence: Major Challenges in Accelerating the Machine Learning Pipeline
• Lower bounds on the number of rounds of the quantum approximate optimization algorithm required for guaranteed approximation ratios
• Performance analysis of a filtering variational quantum algorithm
• Using machine learning for quantum annealing accuracy prediction
• Direct comparison of stochastic driven nonlinear dynamical systems for combinatorial optimization
• Charge-Density-Wave Oscillator Networks for Solving Combinatorial Optimization Problems
• Noise Effects on Diabatic Quantum Annealing Protocols
• Hamiltonian formulations of centroid-based clustering
• Simulating Quantum Circuits with Tree Tensor Networks using Density-Matrix Renormalization Group Algorithm
• SpinGlassPEPS.jl: Tensor-network package for Ising-like optimization on quasi-two-dimensional graphs
• Quantum Circuit Design for Decoded Quantum Interferometry
• Logical and Inequality Implications for Reducing the Size and Complexity of Quadratic Unconstrained Binary Optimization Problems
• The Thermodynamics of the Travelling Salesman Problem
• Optical resonators constitute a universal spin simulator
• Mechanism of defect formation in the quantum annealing of the random transverse-field Ising chain
• Degeneracy Engineering for Classical and Quantum Annealing: A Case Study of Sparse Linear Regression in Collider Physics
• Folding lattice proteins with quantum annealing
• Introducing Reduced-Width QNNs, an AI-inspired Ansatz Design Pattern
• Counting with the quantum alternating operator ansatz
• Efficient Digital Quadratic Unconstrained Binary Optimization Solvers for SAT Problems
• The Computational Limit to Quantum Determinism and the Black Hole Information Loss Paradox
• Stability of energy landscape for Ising models
• Quantum circuit evolutionary framework applied on set partitioning problem
• Can category-theoretic semantics resolve the problem of the interpretation of the quantum state vector?
• Phase-coded Radar Waveform Design with Quantum Annealing
• Efficient QAOA Architecture for Solving Multi-Constrained Optimization Problems
• Quantum Chaos and Universal Trotterisation Behaviours in Digital Quantum Simulations
• Large-scale portfolio optimization with variational neural annealing
• A Hybrid Framework Using a QUBO Solver For Permutation-Based Combinatorial Optimization
• Graph comparison via nonlinear quantum search
• A quantum wire approach to weighted combinatorial graph optimisation problems
• Investigating layer-selective transfer learning of QAOA parameters for Max-Cut problem
• Beyond Ground States: Physics-Inspired Optimization of Excited States of Classical Hamiltonians
• Observation of binary phase states of time-multiplexed degenerate optical parametric oscillator pulses generated using a nonlinear fiber Sagnac loop
• Minor-embedding heuristics for large-scale annealing processors with sparse hardware graphs of up to 102,400 nodes
• Expressive Power and Loss Surfaces of Deep Learning Models
• Improving the trainability of VQE on NISQ computers for solving portfolio optimization using convex interpolation
• Towards Classical Software Verification using Quantum Computers
• Steady state distributions of network of degenerate optical parametric oscillators in solving combinatorial optimization problems
• Sampling (noisy) quantum circuits through randomized rounding
• Qubit-efficient quantum combinatorial optimization solver
• Upper bound inequality for calculation time in simulated annealing analogous to adiabatic theorem in quantum systems
• Efficient inference in the transverse field Ising model
• Multiple Query Optimization using a Hybrid Approach of Classical and Quantum Computing
• Quantitative analysis of the effectiveness of mid-anneal measurement in quantum annealing
• Computational Complexity of Quadratic Unconstrained Binary Optimization
• Surrogate Modeling via Factorization Machine and Ising Model with Enhanced Higher-Order Interaction Learning
• Quantum-inspired search method for low-energy states of classical Ising Hamiltonians
• A loop Quantum Approximate Optimization Algorithm with Hamiltonian updating
• Justifying the Classical-Quantum Divide of the Copenhagen Interpretation
• Numerical Probe of Dynamical Properties of a Two-Dimensional Triangular Ising Lattice with Long-Range Interaction
• Reducing quantum annealing biases for solving the graph partitioning problem
• Computational solution to quantum foundational problems
• Finding the optimal Nash equilibrium in a discrete Rosenthal congestion game using the Quantum Alternating Operator Ansatz
• Curve fitting on a quantum annealer for an advanced navigation method
• 2022 Roadmap on Neuromorphic Computing and Engineering
• Advancing Stochastic 3-SAT Solvers by Dissipating Oversatisfied Constraints
• Generation of all-to-all connections in a two-dimensional qubit array with two-body interactions
• On Assessing the Quantum Advantage for MaxCut Provided by Quantum Neural Network Ansätze
• Machine Learning-assisted High-speed Combinatorial Optimization with Ising Machines for Dynamically Changing Problems
• From Hope to Heuristic: Realistic Runtime Estimates for Quantum Optimisation in NHEP
• Testing Quantum and Simulated Annealers on the Drone Delivery Packing Problem
• Toward quantum scaling advantage in approximate optimization
• Matrix approach to generalized ensemble theory for nonequilibrium discrete systems
• Efficient Construction of Feasible Solutions in Column Generation using Quantum Annealing
• Solving the Turbine Balancing Problem using Quantum Annealing
• Assessing the quantumness of the annealing dynamics via Leggett Gargs inequalities: a weak measurement approach
• Variational Quantum Algorithms for Euclidean Discrepancy and Covariate-Balancing
• A Quantum Constraint Generation Framework for Binary Linear Programs
• Resource-Efficient Quantum Optimization via Higher-Order Encoding
• Statistical quality assessment of Ising-based annealer outputs
• Fast collisional $\sqrt{\mathrm{SWAP}}$ gate for fermionic atoms in an optical superlattice
• Polaritonic XY-Ising Machine
• Adaptive time Compressed QITE (ACQ) and its geometrical interpretation
• Hybrid Quantum-Classical Multi-cut Benders Approach with a Power System Application
• Variational matrix product states for combinatorial optimization
• Thermodynamic significance of QUBO encoding on quantum annealers
• Structural Comparison of Error Mitigation Methods for Ising Machines: Penalty-Spin Model versus Stacked Model
• Quantum annealing and condensed matter physics
• Leveraging Analog Neutral Atom Quantum Computers for Diversified Pricing in Hybrid Column Generation Frameworks
• A Quantum Genetic Algorithm with application to Cosmological Parameters Estimation
• Energy-Efficient p-Bit-Based Fully-Connected Quantum-Inspired Simulated Annealer with Dual BRAM Architecture
• Frustration-enhanced quantum annealing correction models with additional inter-replica interactions
• Energy gap of quantum spin glasses: a projection quantum Monte Carlo study
• Multi-tasking through quantum annealing
• Trajectory-independent speed limits for controlled open quantum systems
• Quantum-inspired Ising machine using sparsified spin connectivity
• A penalty-free quantum algorithm to find energy eigenstates
• Quantum Computation
• Standardization of Multi-Objective QUBOs
• Constrained Quantum Optimization via Iterative Warm-Start XY-Mixers
• Gate Efficient Composition of Hamiltonian Simulation and Block-Encoding with its Application on HUBO, Chemistry and Finite Difference Method
• Multiclass Portfolio Optimization via Variational Quantum Eigensolver with Dicke State Ansatz
• Evaluating the solution performance of the augmented Lagrangian function on Ising machines
• Trigonometric approximation of the Max-Cut Polytope is star-like
• Combining Learned Representations for Combinatorial Optimization
• Quantum imaginary time evolution and UD-MIS problem
• Variational Quantum Algorithm for Constrained Combinatorial Optimization Problems
• Statistical mechanics of the minimum vertex cover problem in stochastic block models
• The Rise of Quantum Computing -- Take a BITE for Built Environment and Urban Microclimate Research
• Limitations in Parallel Ising Machine Networks: Theory and Practice
• Solving Helmholtz problems with finite elements on a quantum annealer
• Grover Adaptive Search with Spin Variables
• GPU-based Ising Computing for Solving Balanced Min-Cut Graph Partitioning Problem
• Non-NP-Hardness of Translationally-Invariant Spin-Model Problems
• BALANCE: Bitrate-Adaptive Limit-Aware Netcast Content Enhancement Utilizing QUBO and Quantum Annealing
• Exploring Airline Gate-Scheduling Optimization Using Quantum Computers
• An Analysis of the Quantum Approximation Optimisation Algorithm
• Quantum Advantage for All
• Quantum tree generator improves QAOA state-of-the-art for the knapsack problem
• Probabilistic imaginary-time evolution by using forward and backward real-time evolution with a single ancilla: first-quantized eigensolver of quantum chemistry for ground states
• Robust Optimization of Unconstrained Binary Quadratic Problems