What is AQC? Goal: Solve an optimization problem using Adiabatic Quantum Computation (AQC)What is AQC What is AQC?Goal: Solve an optimization problem using Adiabatic Quantum Computation (AQC) Map on to problem Hamiltonian H P ⇒ Ground state is the solution Rydberg atomsWhy dressed ground state Rydberg atoms?Ground state neutral atoms allow for precise and robust single qubit control.

Jun 1, 20110 citations

Quantum Information Processing

Adiabatic quantum optimization with qudits

M. H. S. Amin, Neil G. Dickson, Peter Smith

Published Oct 17, 2012• 16 citations

Publisher

DOI: 10.1007/s11128-012-0480-x

Related papers

Qudit-inspired optimization for graph coloring

David Jansen, Timothy Heightman, Luke Mortimer +2 more

We introduce a quantum-inspired algorithm for graph coloring problems (GCPs) that utilizes qudits in a product state, with each qudit representing a node in the graph and parameterized by $d$ -dimensional spherical coordinates. We propose and benchmark two optimization strategies: qudit gradient descent, initiating qudits in random states and employing gradient descent to minimize a cost function; and qudit local quantum annealing, which adapts the local quantum annealing method to optimize an adiabatic transition from a tractable initial function to a problem-specific cost function. Our approaches are benchmarked against established solutions for standard GCPs, showing that our methods not only rival but frequently surpass the performance of recent state-of-the-art algorithms in terms of solution quality and computational efficiency. The adaptability of our algorithm and its high-quality solutions, achieved with minimal computational resources, point to an advancement in the field of quantum-inspired optimization, with potential applications extending to a broad spectrum of optimization problems.We introduce a quantum-inspired algorithm for graph coloring problems (GCPs) that utilizes qudits in a product state, with each qudit representing a node in the graph and parameterized by $d$-dimensional spherical coordinates. We propose and benchmark two optimization strategies: qudit gradient descent, initiating qudits in random states and employing gradient descent to minimize a cost function; and qudit local quantum annealing, which adapts the local quantum annealing method to optimize an adiabatic transition from a tractable initial function to a problem-specific cost function. Our approaches are benchmarked against established solutions for standard GCPs, showing that our methods not only rival but frequently surpass the performance of recent state-of-the-art algorithms in terms of solution quality and computational efficiency. The adaptability of our algorithm and its high-quality solutions, achieved with minimal computational resources, point to an advancement in the field of quantum-inspired optimization, with potential applications extending to a broad spectrum of optimization problems.

arXiv:2406.00792Physical Review AppliedDec 2, 20248 citations

Towards practical quantum optimization

András Czégel

Sep 18, 20260 citations

Quantum Optimization Problems

Tomoyuki Yamakami

arXiv:quant-ph/0204010Lecture notes in computer scienceJan 1, 20022 citations

Adiabatic quantum optimization with qudits

M. H. S. Amin, Neil G. Dickson, Smith, Peter

Most realistic solid state devices considered as qubits are not true two-state systems but multi-level systems. They can approximately be considered as qubits only if the energy separation of the upper energy levels from the lowest two is very large. If this condition is not met, the upper states may affect the evolution and therefore cannot be neglected. Here, we consider devices with double-well potential as basic logical elements, and study the effect of higher energy levels, beyond the lowest two, on adiabatic quantum optimization. We show that the extra levels can be modeled by adding additional (ancilla) qubits coupled to the original (logical) qubits. The presence of these levels is shown to have no effect on the final ground state. We also study their influence on the minimum gap for a set of 8-qubit spin glass instances.Most realistic solid state devices considered as qubits are not true two-state systems but multi-level systems. They can approximately be considered as qubits only if the energy separation of the upper energy levels from the lowest two is very large. If this condition is not met, the upper states may affect the evolution and therefore cannot be neglected. Here, we consider devices with double-well potential as basic logical elements, and study the effect of higher energy levels, beyond the lowest two, on adiabatic quantum optimization. We show that the extra levels can be modeled by adding additional (ancilla) qubits coupled to the original (logical) qubits. The presence of these levels is shown to have no effect on the final ground state. We also study their influence on the minimum gap for a set of 8-qubit spin glass instances.

arXiv:1103.1904Mar 9, 20110 citations

Quantum optimization techniques and applications

Euimin Lee, Shiho Kim

Advances in computersJul 23, 20250 citations

Adiabatic quantum computing with dressed Rydberg atoms.

Grant W. Biedermann, Andrew J. Landahl, Yuan‐Yu Jau +3 more

Jun 1, 20110 citations

We introduce a quantum-inspired algorithm for graph coloring problems (GCPs) that utilizes qudits in a product state, with each qudit representing a node in the graph and parameterized by

d

-dimensional spherical coordinates. We propose and benchmark two optimization strategies: qudit gradient descent, initiating qudits in random states and employing gradient descent to minimize a cost function; and qudit local quantum annealing, which adapts the local quantum annealing method to optimize an adiabatic transition from a tractable initial function to a problem-specific cost function. Our approaches are benchmarked against established solutions for standard GCPs, showing that our methods not only rival but frequently surpass the performance of recent state-of-the-art algorithms in terms of solution quality and computational efficiency. The adaptability of our algorithm and its high-quality solutions, achieved with minimal computational resources, point to an advancement in the field of quantum-inspired optimization, with potential applications extending to a broad spectrum of optimization problems.