Sub-universal variational circuits for combinatorial optimization problems
arXiv:2308.14981 · doi:10.1103/v1sh-fg6f
Abstract
Quantum variational circuits have gained significant attention due to their applications in the quantum approximate optimization algorithm and quantum machine learning research. This work introduces a novel class of classical probabilistic circuits designed for generating approximate solutions to combinatorial optimization problems constructed using two-bit stochastic matrices. Through a numerical study, we investigate the performance of our proposed variational circuits in solving the Max-Cut problem on various graphs of increasing sizes. Our classical algorithm demonstrates improved performance for several graph types to the quantum approximate optimization algorithm. Our findings suggest that evaluating the performance of quantum variational circuits against variational circuits with sub-universal gate sets is a valuable benchmark for identifying areas where quantum variational circuits can excel.
10 pages, 7 figures
References in corpus (21)
- A variational eigenvalue solver on a quantum processor
- Variational Quantum Algorithms
- Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
- Quantum Optimization of Maximum Independent Set using Rydberg Atom Arrays
- Stochastic p-bits for Invertible Logic
- Quantum Approximate Optimization of the Long-Range Ising Model with a Trapped-Ion Quantum Simulator
- p-Bits for Probabilistic Spin Logic
- A full-stack view of probabilistic computing with p-bits: devices, architectures and algorithms
- Scalable Semidefinite Programming
- CMOS + stochastic nanomagnets: heterogeneous computers for probabilistic inference and learning
- Efficient classical simulation of matchgate circuits with generalized inputs and measurements
- Optical Hybrid Quantum Information Processing
- Equilibrium to nonequilibrium condensation in driven-dissipative semiconductor systems
- Scalable Emulation of Sign-ProblemFree Hamiltonians with Room Temperature p-bits
- Experimental demonstration of an integrated on-chip p-bit core utilizing stochastic Magnetic Tunnel Junctions and 2D-MoS2 FETs
- A semi-agnostic ansatz with variable structure for quantum machine learning
- Further extensions of Clifford circuits and their classical simulation complexities
- Probabilistic-Bits based on Ferroelectric Field-Effect Transistors for Stochastic Computing
- Low-depth Clifford circuits approximately solve MaxCut
- Superior probabilistic computing using operationally stable probabilistic-bit constructed by manganite nanowire
- Approximate optimization of MAXCUT with a local spin algorithm