Related papers: Quest for quantum advantage: Monte Carlo wave-func…
Sampling problems are widely regarded as the task for which quantum computers can most readily provide a quantum advantage. Leveraging this feature, the quantum-enhanced Markov chain Monte Carlo [Layden, D. et al., Nature 619, 282-287…
Verification of binary neural network (BNN) robustness is NP-hard, as it can be formulated as a combinatorial search for an adversarial perturbation that induces misclassification. Exact verification methods therefore scale poorly with…
Quantum spin systems with strong geometric restrictions give rise to rich quantum phases such as valence bond solids and spin liquid states. However, the geometric restrictions often hamper the application of sophisticated numerical…
A quantum simulator is a well controlled quantum system that can simulate the behavior of another quantum system which may require exponentially large classical computing resources to understand otherwise. In the 1980s, Feynman proposed the…
We explore the potential of spatial-photonic Ising machines (SPIMs) to address computationally intensive Ising problems that employ low-rank and circulant coupling matrices. Our results indicate that the performance of SPIMs is critically…
The goal of this work is to lay the groundwork to construct and characterize a quantum device; which we refer to as a superfluid ring lattice; that could serve as a multi-qubit system in the future. Accordingly, a mathematical framework,…
Coupled parametric oscillators were recently employed as simulators of artificial Ising networks, with the potential to solve computationally hard minimization problems. We demonstrate a new dynamical regime within the simplest network -…
The spatial photonic Ising machine (SPIM) [D. Pierangeli et al., Phys. Rev. Lett. 122, 213902 (2019)] is a promising optical architecture utilizing spatial light modulation for solving large-scale combinatorial optimization problems…
In the last few years we have been developing a Monte Carlo simulation method to cope with systems of many electrons and ions in the Born-Oppenheimer (BO) approximation, the Coupled Electron-Ion Monte Carlo Method (CEIMC). Electronic…
We study the application of emerging photonic and quantum computing architectures to solving the Traveling Salesman Problem (TSP), a well-known NP-hard optimization problem. We investigate several approaches: Simulated Annealing (SA),…
Sampling from complicated probability distributions is a hard computational problem arising in many fields, including statistical physics, optimization, and machine learning. Quantum computers have recently been used to sample from…
Ising machines offer a compelling approach to addressing NP-hard problems, but physical realizations that are simultaneously scalable, reconfigurable, fast, and stable remain elusive. Quantum annealers, like D-Wave's cryogenic hardware,…
The recent emergence of novel computational devices, such as adiabatic quantum computers, CMOS annealers, and optical parametric oscillators, present new opportunities for hybrid-optimization algorithms that are hardware accelerated by…
Combinatorial optimization problems (COPs) are crucial in many applications but are computationally demanding. Traditional Ising annealers address COPs by directly converting them into Ising models (known as direct-E transformation) and…
We give a detailed theoretical derivation of the quantum master equation for the coherent Ising machine. This is a quantum computational network with feedback, that solves NP hard combinatoric problems, including the traveling salesman…
We propose a neural network model, which, with appropriate assignment of the stability of its equilibrium points (EPs), achieves Hopfield-like associative memory. The oscillator Ising machine (OIM) is an ideal candidates for such a model,…
We study the performance scaling of three quantum algorithms for combinatorial optimization: measurement-feedback coherent Ising machines (MFB-CIM), discrete adiabatic quantum computation (DAQC), and the D\"urr-Hoyer algorithm for quantum…
The quantum Monte Carlo (QMC) is one of the most promising many-body electronic structure approaches. It employs stochastic techniques for solving the stationary Schr\" odinger equation and for evaluation of expectation values. The key…
Quantum annealing has emerged as a powerful platform for simulating and optimizing classical and quantum Ising models. Quantum annealers, like other quantum and/or analog computing devices, are susceptible to nonidealities including…
The traditional clustering problem of renewable energy profiles is typically formulated as a combinatorial optimization that suffers from the Curse of Dimensionality (CoD) on classical computers. To address this issue, this paper first…