2000 character limit reached
Escaping Local Minima with Quantum Coherent Cooling
Published 21 Feb 2023 in quant-ph | (2302.10427v2)
Abstract: Quantum cooling has demonstrated its potential in quantum computing, which can reduce the number of control channels needed for external signals. Recent progress also supports the possibility of maintaining quantum coherence in large-scale systems. The limitations of classical algorithms trapped in local minima of cost functions could be overcome using this scheme. According to this, we propose a hybrid quantum-classical algorithm for finding the global minima. Our approach utilizes quantum coherent cooling to facilitate coordinative tunneling through energy barriers if the classical algorithm gets stuck. The encoded Hamiltonian system represents the cost function, and a quantum coherent bath in the ground state serves as a heat sink to absorb energy from the system. Our proposed scheme can be implemented in the circuit quantum electrodynamics (cQED) system using a quantum cavity. The provided numerical evidence demonstrates the quantum advantage in solving spin glass problems.
- J. R. Espinosa, Tunneling without bounce, Phys. Rev. D 100, 105002 (2019).
- J.-J. Feng, B. Wu, and F. Wilczek, Quantum computing by coherent cooling, Phys. Rev. A 105, 052601 (2022).
- E. Farhi, J. Goldstone, and S. Gutmann, A quantum approximate optimization algorithm (2014), arXiv:1411.4028 [quant-ph] .
- J. Preskill, Quantum Computing in the NISQ era and beyond, Quantum 2, 79 (2018).
- E. Gil-Fuster, J. Eisert, and C. Bravo-Prieto, Understanding quantum machine learning also requires rethinking generalization (2023), arXiv:2306.13461 [quant-ph] .
- B. Bollig and I. Wegener, Improving the variable ordering of obdds is np-complete, IEEE Transactions on Computers 45, 993 (1996).
- V. Kolmogorov and R. Zabin, What energy functions can be minimized via graph cuts?, IEEE Transactions on Pattern Analysis and Machine Intelligence 26, 147 (2004).
- C. A. Tovey, A simplified np-complete satisfiability problem, Discrete Applied Mathematics 8, 85 (1984).
- S. Sakai, M. Togasaki, and K. Yamazaki, A note on greedy algorithms for the maximum weighted independent set problem, Discrete Applied Mathematics 126, 313 (2003).
- Y. Hu, Z. Zhang, and B. Wu, Quantum algorithm for a set of quantum 2sat problems, Chinese Physics B 30, 020308 (2021).
- H. Yu, F. Wilczek, and B. Wu, Quantum algorithm for approximating maximum independent sets, Chinese Physics Letters 38, 030304 (2021).
- C. A. Trugenberger, Probabilistic quantum memories, Phys. Rev. Lett. 87, 067901 (2001).
- C. Ahn, H. M. Wiseman, and G. J. Milburn, Quantum error correction for continuously detected errors, Phys. Rev. A 67, 052310 (2003).
- N. A. RodrÃguez-Briones and R. Laflamme, Achievable polarization for heat-bath algorithmic cooling, Phys. Rev. Lett. 116, 170501 (2016).
- M. Aspelmeyer, T. J. Kippenberg, and F. Marquardt, Cavity optomechanics, Rev. Mod. Phys. 86, 1391 (2014).
- A. N. Cleland and M. R. Geller, Superconducting qubit storage and entanglement with nanomechanical resonators, Phys. Rev. Lett. 93, 070501 (2004).
- A. Lucas, Ising formulations of many np problems, Frontiers in Physics 2, 10.3389/fphy.2014.00005 (2014).
- M. Malekakhlagh, A. Petrescu, and H. E. Türeci, Cutoff-free circuit quantum electrodynamics, Phys. Rev. Lett. 119, 073601 (2017).
- P. Talkner and P. Hänggi, Colloquium: Statistical mechanics and thermodynamics at strong coupling: Quantum and classical, Rev. Mod. Phys. 92, 041002 (2020).
- J. Liu, K. A. Jung, and D. Segal, Periodically driven quantum thermal machines from warming up to limit cycle, Phys. Rev. Lett. 127, 200602 (2021).
- A. Caldeira and A. Leggett, Path integral approach to quantum brownian motion, Physica A: Statistical Mechanics and its Applications 121, 587 (1983).
- A. Polkovnikov, Phase space representation of quantum dynamics, Annals of Physics 325, 1790 (2010).
- T. L. Curtright and C. K. Zachos, Quantum mechanics in phase space, Asia Pacific Physics Newsletter 01, 37 (2012).
- Z. Wang, J. Feng, and B. Wu, Microscope for quantum dynamics with planck cell resolution, Phys. Rev. Research 3, 033239 (2021).
- Q. Zhang and B. Wu, General approach to quantum-classical hybrid systems and geometric forces, Phys. Rev. Lett. 97, 190401 (2006).
- A. M. Childs and J. Goldstone, Spatial search by quantum walk, Phys. Rev. A 70, 022314 (2004).
- A. M. Childs, Universal computation by quantum walk, Phys. Rev. Lett. 102, 180501 (2009).
- S. E. Venegas-Andraca, Quantum walks: a comprehensive review, Quantum Information Processing 11, 1015 (2012).
- Y. Liu, W. J. Su, and T. Li, On Quantum Speedups for Nonconvex Optimization via Quantum Tunneling Walks, Quantum 7, 1030 (2023).
- F. Casas, A. Murua, and M. Nadinic, Efficient computation of the zassenhaus formula, Computer Physics Communications 183, 2386 (2012).
- J. Kempe, Quantum random walks: An introductory overview, Contemporary Physics 44, 307 (2003).
- N. Shenvi, J. Kempe, and K. BirgittaWhaley, Quantum random-walk search algorithm, Phys. Rev. A 67, 052307 (2003).
- S. Polla, Y. Herasymenko, and T. E. O’Brien, Quantum digital cooling, Phys. Rev. A 104, 012414 (2021).
- P. A. Camati, J. F. G. Santos, and R. M. Serra, Employing non-markovian effects to improve the performance of a quantum otto refrigerator, Phys. Rev. A 102, 012217 (2020).
- Q. Zhang, Z.-X. Man, and Y.-J. Xia, Non-markovianity and the landauer principle in composite thermal environments, Phys. Rev. A 103, 032201 (2021).
- A. M. van den Brink, A. J. Berkley, and M. Yalowsky, Mediated tunable coupling of flux qubits, New Journal of Physics 7, 230 (2005).
- X. Qiu, P. Zoller, and X. Li, Programmable quantum annealing architectures with ising quantum wires, PRX Quantum 1, 020311 (2020).
- A. C. Potter, R. Vasseur, and S. A. Parameswaran, Universal properties of many-body delocalization transitions, Phys. Rev. X 5, 031033 (2015).
- M. Serbyn, Z. Papić, and D. A. Abanin, Criterion for many-body localization-delocalization phase transition, Phys. Rev. X 5, 041047 (2015).
- D. J. Luitz, N. Laflorencie, and F. Alet, Many-body localization edge in the random-field heisenberg chain, Phys. Rev. B 91, 081103 (2015).
- M. Xiao and H. Nagamochi, Exact algorithms for maximum independent set, Information and Computation 255, 126 (2017).
- M. Orszag and J. Retamal, Modern Challenges in Quantum Optics (Springer, 2001).
- X. Li, Y. Zhou, and H. Zhang, Manipulating atom-cavity interactions with configurable atomic chains (2023), arXiv:2308.07908 [quant-ph] .
- V. Kendon and B. Tregenna, Decoherence can be useful in quantum walks, Phys. Rev. A 67, 042315 (2003).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
