Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2407.11851

Atom Cavity Encoding for NP-Complete Problems

Ye, Meng, Xiaopeng Li

Published Jul 16, 2024• 0 citations
arXivHTMLPDF

Abstract

We consider an atom-cavity system having long-range atomic interactions mediated by cavity modes. It has been shown that quantum simulations of spin models with this system can naturally be used to solve number partition problems. Here, we present encoding schemes for numerous NP-complete problems, encompassing the majority of Karp's 21 NP-complete problems. We find a number of such computation problems can be encoded by the atom-cavity system at a linear cost of atom number. There are still certain problems that cannot be encoded by the atom-cavity as efficiently, such as quadratic unconstrained binary optimization (QUBO), and the Hamiltonian cycle. For these problems, we provide encoding schemes with a quadratic or quartic cost in the atom number. We expect this work to provide important guidance to search for the practical quantum advantage of the atom-cavity system in solving NP-complete problems. Moreover, the encoding schemes we develop here may also be adopted in other optical systems for solving NP-complete problems, where a similar form of Mattis-type spin glass Hamiltonian as in the atom-cavity system can be implemented.

DOI
10.48550/arxiv.2407.11851

Related papers

Atom cavity encoding for NP-complete problems

Meng Ye, Xiaopeng Li

Abstract We consider an atom-cavity system having long-range atomic interactions mediated by cavity modes. It has been shown that quantum simulations of spin models with this system can naturally be used to solve number partition problems. Here, we present encoding schemes for numerous nondeterministic polynomial-time complete (NP-complete) problems, encompassing the majority of Karp’s 21 NP-complete problems. We find a number of such computation problems can be encoded by the atom-cavity system at a linear cost of atom number. There are still certain problems that cannot be encoded by the atom-cavity as efficiently, such as quadratic unconstrained binary optimization (QUBO), and the Hamiltonian cycle. For these problems, we provide encoding schemes with a quadratic or quartic cost in the atom number. We expect this work to provide important guidance to search for the practical quantum advantage of the atom-cavity system in solving NP-complete problems. Moreover, the encoding schemes we develop here may also be adopted in other optical systems for solving NP-complete problems, where a similar form of Mattis-type spin glass Hamiltonian as in the atom-cavity system can be implemented.

Quantum Frontiers•Nov 28, 2024•3 citations

Universal Quantum Optimization with Cold Atoms in an Optical Cavity

Meng Ye, Ye Tian, Jian Hui Lin +6 more

Cold atoms in an optical cavity have been widely used for quantum simulations of many-body physics, where the quantum control capability has been advancing rapidly in recent years. Here, we show the atom cavity system is universal for quantum optimization with arbitrary connectivity. We consider a single-mode cavity and develop a Raman coupling scheme by which the engineered quantum Hamiltonian for atoms directly encodes number partition problems. The programmability is introduced by placing the atoms at different positions in the cavity with optical tweezers. The number partition problem solution is encoded in the ground state of atomic qubits coupled through a photonic cavity mode, which can be reached by adiabatic quantum computing. We construct an explicit mapping for the 3-SAT and vertex cover problems to be efficiently encoded by the cavity system, which costs linear overhead in the number of atomic qubits. The atom cavity encoding is further extended to quadratic unconstrained binary optimization problems. The encoding protocol is optimal in the cost of atom number scaling with the number of binary degrees of freedom of the computation problem. Our theory implies the atom cavity system is a promising quantum optimization platform searching for practical quantum advantage.

arXiv:2306.16943•Physical Review Letters•Sep 5, 2023•18 citations

Adaptive quantum optimization algorithms for programmable atom-cavity systems

Yuchen Luo, Xiaopeng Li, Jian Hui Lin

Developing quantum algorithms adaptive to specific constraints of near-term devices is an essential step towards practical quantum advantage. In a recent work [Phys. Rev. Lett. 131, 103601 (2023)], we show cold atoms in an optical cavity can be built as a universal quantum optimizer with programmable all-to-all interactions, and the effective Hamiltonian for atoms directly encodes number partitioning problems (NPPs). Here, we numerically investigate the performance of quantum annealing (QA) and quantum approximate optimization algorithm (QAOA) to find the solution of NPP that is encoded in the ground state of atomic qubits. We find the success probability of the standard QA decays rapidly with the problem size. The optimized annealing path or inhomogeneous driving fields only lead to mild improvement on the success probability. Similarly, the QAOA always gets trapped in a false local minimum, and there is no significant performance improvement as we increase the depth of the quantum circuit. To overcome the difficulty of solving NPPs, we propose an adaptive variational quantum algorithm (VQA) whose ansatz differs from that of the QAOA by releasing the parameter freedom of the NPP Hamiltonian. Through numerical simulations, we find that our adaptive VQA can achieve rather high success probability within very small circuit depth. It is thus worth paying the extra optimization cost of additional parameters for improving performance compared to the QAOA. Therefore, our adaptive VQA provides a promising choice for programmable atom-cavity systems to demonstrate competitive computational power within its quantum coherence time.

arXiv:2406.07055•Physical Review A•Nov 25, 2025•1 citation

Number Partitioning With Grover’s Algorithm in Central Spin Systems

Galit Anikeeva, Ognjen Marković, Victoria Borish +7 more

Numerous conceptually important quantum algorithms rely on a blackbox device known as an oracle, which is typically difficult to construct without knowing the answer to the problem that the algorithm is intended to solve.A notable example is Grover's search algorithm.Here we propose a Grover search for solutions to a class of NP-complete decision problems known as subset sum problems, including the special case of number partitioning.Each problem instance is encoded in the couplings of a set of qubits to a central spin or boson, which enables a realization of the oracle without knowledge of the solution.The algorithm provides a quantum speedup across a known phase transition in the computational complexity of the partition problem, and we identify signatures of the phase transition in the simulated performance.Whereas the naive implementation of our algorithm requires a spectral resolution that scales exponentially with system size for NP-complete problems, we also present a recursive algorithm that enables scalability.We propose and analyze implementation schemes with cold atoms, including Rydberg-atom and cavity-QED platforms.

arXiv:2009.05549•PRX Quantum•May 13, 2021•33 citations

Scalable quantum computing with atomic ensembles

S. D. Barrett, Peter P. Rohde, Thomas M. Stace

Atomic ensembles, comprising clouds of atoms addressed by laser fields, provide an attractive system for both the storage of quantum information and the coherent conversion of quantum information between atomic and optical degrees of freedom. We describe a scheme for full-scale quantum computing with atomic ensembles, in which qubits are encoded in symmetric collective excitations of many atoms. We consider the most important sources of error—imperfect exciton–photon coupling and photon losses—and demonstrate that the scheme is extremely robust against these processes: the required photon emission and collection efficiency threshold is ≳86%. Our scheme uses similar methods to those already demonstrated experimentally in the context of quantum repeater schemes and yet has information processing capabilities far beyond those proposals.

arXiv:0804.0962•New Journal of Physics•Sep 22, 2010•46 citations

QUBO for training regression models

M. Caruso, Daniel Escánez-Expósito, Pino Caballero‐Gil +1 more

A constantly increasing number of parameters in modern machine learning models has become a significant bottleneck in their efficient training, resulting in a disproportionate consumption of resources, expressed in terms of energy and computational time. The vast majority of such resources are allocated to the training phase rather than the inference stage, leading to an inefficient process [1] , [2] , [3] . This study addresses this problem by introducing a quantum alternative for training machine learning models, formalized as a Quadratic Unconstrained Binary Optimization ( QUBO ) problem. Adiabatic quantum computers have shown promise in approximately solving certain NP -hard problems, such as QUBO , potentially offering speed advantages over classical computers in specific scenarios [ 4 , 5, [6] , [7] ]. Given that many machine learning problems are also NP -hard, adiabatic quantum computers could play a pivotal role in efficiently training machine learning models. Furthermore, inspired by the ones’ complement binary numeral system, this work includes the proposal of an efficient binary-to-decimal encoding, which improves data representation in the quantum context. A concrete implementation of a regression training problem on specific quantum hardware is also presented here, the results of which suggest that the adoption of quantum techniques in model training allows not only to address the problem of parameter explosion but also to offer promising prospects for significantly accelerate the training process by exploiting the unique properties of quantum computation.

Journal of Computational and Applied Mathematics•Apr 2, 2026•0 citations
We consider an atom-cavity system having long-range atomic interactions mediated by cavity modes. It has been shown that quantum simulations of spin models with this system can naturally be used to solve number partition problems. Here, we present encoding schemes for numerous NP-complete problems, encompassing the majority of Karp's 21 NP-complete problems. We find a number of such computation problems can be encoded by the atom-cavity system at a linear cost of atom number. There are still certain problems that cannot be encoded by the atom-cavity as efficiently, such as quadratic unconstrained binary optimization (QUBO), and the Hamiltonian cycle. For these problems, we provide encoding schemes with a quadratic or quartic cost in the atom number. We expect this work to provide important guidance to search for the practical quantum advantage of the atom-cavity system in solving NP-complete problems. Moreover, the encoding schemes we develop here may also be adopted in other optical systems for solving NP-complete problems, where a similar form of Mattis-type spin glass Hamiltonian as in the atom-cavity system can be implemented.
Abstract We consider an atom-cavity system having long-range atomic interactions mediated by cavity modes. It has been shown that quantum simulations of spin models with this system can naturally be used to solve number partition problems. Here, we present encoding schemes for numerous nondeterministic polynomial-time complete (NP-complete) problems, encompassing the majority of Karp’s 21 NP-complete problems. We find a number of such computation problems can be encoded by the atom-cavity system at a linear cost of atom number. There are still certain problems that cannot be encoded by the atom-cavity as efficiently, such as quadratic unconstrained binary optimization (QUBO), and the Hamiltonian cycle. For these problems, we provide encoding schemes with a quadratic or quartic cost in the atom number. We expect this work to provide important guidance to search for the practical quantum advantage of the atom-cavity system in solving NP-complete problems. Moreover, the encoding schemes we develop here may also be adopted in other optical systems for solving NP-complete problems, where a similar form of Mattis-type spin glass Hamiltonian as in the atom-cavity system can be implemented.
Cold atoms in an optical cavity have been widely used for quantum simulations of many-body physics, where the quantum control capability has been advancing rapidly in recent years. Here, we show the atom cavity system is universal for quantum optimization with arbitrary connectivity. We consider a single-mode cavity and develop a Raman coupling scheme by which the engineered quantum Hamiltonian for atoms directly encodes number partition problems. The programmability is introduced by placing the atoms at different positions in the cavity with optical tweezers. The number partition problem solution is encoded in the ground state of atomic qubits coupled through a photonic cavity mode, which can be reached by adiabatic quantum computing. We construct an explicit mapping for the 3-SAT and vertex cover problems to be efficiently encoded by the cavity system, which costs linear overhead in the number of atomic qubits. The atom cavity encoding is further extended to quadratic unconstrained binary optimization problems. The encoding protocol is optimal in the cost of atom number scaling with the number of binary degrees of freedom of the computation problem. Our theory implies the atom cavity system is a promising quantum optimization platform searching for practical quantum advantage.
Developing quantum algorithms adaptive to specific constraints of near-term devices is an essential step towards practical quantum advantage. In a recent work [Phys. Rev. Lett. 131, 103601 (2023)], we show cold atoms in an optical cavity can be built as a universal quantum optimizer with programmable all-to-all interactions, and the effective Hamiltonian for atoms directly encodes number partitioning problems (NPPs). Here, we numerically investigate the performance of quantum annealing (QA) and quantum approximate optimization algorithm (QAOA) to find the solution of NPP that is encoded in the ground state of atomic qubits. We find the success probability of the standard QA decays rapidly with the problem size. The optimized annealing path or inhomogeneous driving fields only lead to mild improvement on the success probability. Similarly, the QAOA always gets trapped in a false local minimum, and there is no significant performance improvement as we increase the depth of the quantum circuit. To overcome the difficulty of solving NPPs, we propose an adaptive variational quantum algorithm (VQA) whose ansatz differs from that of the QAOA by releasing the parameter freedom of the NPP Hamiltonian. Through numerical simulations, we find that our adaptive VQA can achieve rather high success probability within very small circuit depth. It is thus worth paying the extra optimization cost of additional parameters for improving performance compared to the QAOA. Therefore, our adaptive VQA provides a promising choice for programmable atom-cavity systems to demonstrate competitive computational power within its quantum coherence time.
Numerous conceptually important quantum algorithms rely on a blackbox device known as an oracle, which is typically difficult to construct without knowing the answer to the problem that the algorithm is intended to solve.A notable example is Grover's search algorithm.Here we propose a Grover search for solutions to a class of NP-complete decision problems known as subset sum problems, including the special case of number partitioning.Each problem instance is encoded in the couplings of a set of qubits to a central spin or boson, which enables a realization of the oracle without knowledge of the solution.The algorithm provides a quantum speedup across a known phase transition in the computational complexity of the partition problem, and we identify signatures of the phase transition in the simulated performance.Whereas the naive implementation of our algorithm requires a spectral resolution that scales exponentially with system size for NP-complete problems, we also present a recursive algorithm that enables scalability.We propose and analyze implementation schemes with cold atoms, including Rydberg-atom and cavity-QED platforms.
Atomic ensembles, comprising clouds of atoms addressed by laser fields, provide an attractive system for both the storage of quantum information and the coherent conversion of quantum information between atomic and optical degrees of freedom. We describe a scheme for full-scale quantum computing with atomic ensembles, in which qubits are encoded in symmetric collective excitations of many atoms. We consider the most important sources of error—imperfect exciton–photon coupling and photon losses—and demonstrate that the scheme is extremely robust against these processes: the required photon emission and collection efficiency threshold is ≳86%. Our scheme uses similar methods to those already demonstrated experimentally in the context of quantum repeater schemes and yet has information processing capabilities far beyond those proposals.
A constantly increasing number of parameters in modern machine learning models has become a significant bottleneck in their efficient training, resulting in a disproportionate consumption of resources, expressed in terms of energy and computational time. The vast majority of such resources are allocated to the training phase rather than the inference stage, leading to an inefficient process [1] , [2] , [3] . This study addresses this problem by introducing a quantum alternative for training machine learning models, formalized as a Quadratic Unconstrained Binary Optimization ( QUBO ) problem. Adiabatic quantum computers have shown promise in approximately solving certain NP -hard problems, such as QUBO , potentially offering speed advantages over classical computers in specific scenarios [ 4 , 5, [6] , [7] ]. Given that many machine learning problems are also NP -hard, adiabatic quantum computers could play a pivotal role in efficiently training machine learning models. Furthermore, inspired by the ones’ complement binary numeral system, this work includes the proposal of an efficient binary-to-decimal encoding, which improves data representation in the quantum context. A concrete implementation of a regression training problem on specific quantum hardware is also presented here, the results of which suggest that the adoption of quantum techniques in model training allows not only to address the problem of parameter explosion but also to offer promising prospects for significantly accelerate the training process by exploiting the unique properties of quantum computation.