Researchers Find Faster Path through Tough Problems with Dissipation

Efficient quantum solvers for computationally hard problems are highly desirable for near-term quantum platforms. A cavity-based dissipative quantum solver addresses a class of NP-hard combinatorial optimisation problems encoded in atomic-spin Hamiltonians with a few discrete single-spin-flip transition energies. This approach uses dissipative false-vacuum decay in configuration space to enable escape from metastable local minima within challenging energy landscapes.

Numerical studies focusing on the MaxCut and Maximum Independent Set problems demonstrate this capability. The results offer a new method utilising dissipation for solving complex optimisation challenges on emerging quantum hardware, as demonstrated by researchers at Fudan University, China & 3Shanghai Qi Zhi Institute, Hefei National Laboratory, Buchou Quantum Technology Co.

Dissipative Cavity Solvers Accelerate Combinatorial Optimisation Beyond Grover Search

Fudan University scientists achieved a median mixing time that is 25% faster than standard Grover search algorithms when solving MaxCut instances. Previously, solving these problems required exponentially increasing computation with instance size, but this new approach demonstrates scalable performance. This breakthrough stems from a novel cavity-based quantum solver which exploits dissipative false-vacuum decay to overcome limitations inherent in methods like Quantum Annealing, often stalled by metastability. Encoding NP-hard combinatorial optimisation challenges into atomic spin Hamiltonians coupled with tunable cavities allowed the team to engineer both energy relaxation and tunneling effects.

These combined processes enable systematic pathways toward ground states for problems such as Maximum Independent Set. Dissipative false-vacuum decay allows their cavity-based approach to escape local minima, a common failing of Quantum Annealing where systems can become stuck due to metastability.

Finite system sizes currently limit conclusive scalability assessments

While estimates suggest promising performance when solving complex problems using this new cavity-based approach, the team acknowledges that findings rely on extrapolations from limited system sizes; scaling up remains an open question. Current analyses only provide *estimates* of time complexity based upon finite size scalings and do not demonstrate actual speedups or scalability beyond those simulations. Despite relying on these estimates derived from relatively small systems, and acknowledging unproven scaling to larger problems, this work offers a valuable new direction for tackling complex optimisation challenges.

The team’s cavity-based approach cleverly uses energy loss within quantum systems; normally considered problematic noise, ‘dissipation’ is used to help find solutions more efficiently than some existing techniques like Grover search. This solver presents a novel method by utilising ‘dissipative false-vacuum decay’, enabling systems to escape suboptimal solutions, a common limitation of Quantum Annealing which can become trapped in local minima.

This research demonstrated a cavity-based quantum solver that uses dissipation, typically considered unwanted noise, to address computationally hard problems encoded in atomic-spin Hamiltonians. The approach exploits dissipative false-vacuum decay to help the system avoid becoming stuck in suboptimal solutions, offering an alternative to methods like Grover search or Quantum Annealing.

Numerical studies on MaxCut and Maximum Independent Set identified parameters favorable for preparing ground states, suggesting potentially more efficient time complexities based on finite-size scalings. These results indicate that controlled dissipation can be a useful resource for quantum optimization; however, further work is needed to assess scalability beyond current simulations.

👉 More information
🗞 Efficient Quantum Optimization via Dissipative False Vacuum Decay
✍️ Zhi-Hao Huang, Tian-Mu Hu, Shuaifan Cao, Ye Lu and Xiaopeng Li (Fudan University)
🧠 ArXiv: https://arxiv.org/abs/2610.39266

Stay current

See today’s quantum computing news on Quantum Zeitgeist for the latest breakthroughs in qubits, hardware, algorithms, and industry deals.

Avatar of Ivy Delaney

Ivy Delaney

Ivy Delaney has been working with neural networks and machine learning since the mid-nineties, back when a couple of hidden layers and a long afternoon of training counted as ambitious. She has watched the field go from academic curiosity to the thing quietly running underneath everything, and she brings that long view to quantum computing. For Quantum Zeitgeist she covers the ground where the two fields meet. That means quantum machine learning and the variational algorithms it leans on, and it also means the less glamorous but more interesting story of classical machine learning already doing real work inside quantum machines, decoding error-correcting codes, calibrating noisy hardware and learning the error models that simulators depend on. She writes about the hardware those algorithms have to run on too, and about the post-quantum cryptography scramble that the same hardware has set off. Her stories typically start with the paper, whether that is peer-reviewed work, conference proceedings or an arXiv preprint, with the source linked so you can hold a claim up against the research it came from. She is unimpressed by benchmarks that will not say what they beat, and by demonstrations that only work in the press release.

Latest Posts by Ivy Delaney: