Jan 2025· Quantum Science and Technology· Vol 11, pp. 045018· 1 citation· 16 references
PhysicsMathematics
Abstract
The coherent Ising machine (CIM) is a quantum network of optical parametric oscillators intended to find ground states of the Ising model. This is an NP-hard problem, related to several important minimization problems, including the max-cut graph problem. In order to enhance its potential performance, we analyze the coherent coupling strategy for the CIM in a highly quantum regime. To explore this limit, without assuming Gaussianity, we employ accurate numerical simulations. Due to the inherent complexity of the system, the maximum network size is limited. While master equation methods can be used, their scalability diminishes rapidly for larger systems. Instead, we use Monte Carlo wave-function methods, which scale as the wave-function dimension, and use large numbers of samples. These simulations involve Hilbert spaces exceeding 107 dimensions. To evaluate success probabilities, we use quadrature probabilities. We demonstrate the potential for quantum computational advantage by reducing the time required to reach maximum success probability in a low-dissipation regime enabled by initial quantum superpositions and entanglement. Furthermore, we demonstrate that tailored time-dependent couplings can amplify these quantum effects. Comparisons with classical CIM models give evidence consistent with a quantum escape mechanism, possibly involving tunneling effects in this strong coupling limit, that can overcome trapping in false minima. This can greatly increase success rates, indicating a potential for quantum advantage. Finally, we perform a coherence analysis based on the state purity to examine the role of quantum coherence in CIM performance and to determine how state purity correlates with improved optimization outcomes.
Programmable quantum annealers can realize real-time dynamics of frustrated transverse-field Ising models on large, nontrivial graphs. Recent work by King et al. argued that the classical simulation of such experiments would require exponential computational resources for classical methods such as tensor networks and n...
One of the main challenges in quantum simulation is the prohibitive cost of computing its solutions in the semi-classical regime, in which the de Broglie wavelength is small compared with the characteristic length scale and the solution is highly oscillatory. This difficulty is overcome by using the Weyl variable, unde...
Quantum Monte Carlo (QMC) methods are among the central numerical tools for studying strongly correlated quantum many-body systems, particularly in higher dimensions. As quantum information has introduced new information-theoretic perspectives and diagnostics into many-body physics, QMC methods have accordingly been ex...
The frustrated Ising ring is one of the simplest models exhibiting exponential closing spectral gaps, making it a paradigmatic and challenging benchmark for quantum annealing (QA). Ground-state preparation for this model has therefore been studied extensively in both continuous-time QA and digitized protocols such as t...
Ruiyi Wang, Anita Weidinger, G. Mbeng et al.· 0 citations
Quantum Amplitude Amplification (QAA), the generalization of Grover's algorithm, is well-positioned for combinatorial optimization and is particularly promising for Quadratic Unconstrained Binary Optimization (QUBO) problems. QAA is appealing due to its ability to drive the quantum system to a target state, yielding th...
In this work, we extend the scattering quantum walk (SQW) framework to a lattice of energy-dependent point interactions. This yields, within the coined quantum walk (CQW) formalism, a coin operator that is directly related to the scattering matrix of zero-range potentials. The model thus provides a discrete-time quantu...
Alana Spak dos Santos, T. T. Tsutsui, F. M. Andrade· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.