# Computational supremacy in quantum simulation

**Authors:** Andrew D. King, Alberto Nocera, Marek M. Rams, Jacek Dziarmaga, Roeland Wiersema, William Bernoudy, Jack Raymond, Nitin Kaushal, Niclas Heinsdorf, Richard Harris, Kelly Boothby, Fabio Altomare, Andrew J. Berkley, Martin Boschnak, Kevin Chern, Holly Christiani, Samantha Cibere, Jake Connor, Martin H. Dehn, Rahul Deshpande  
**arXiv:** [2403.00910](https://arxiv.org/abs/2403.00910)  
**Date:** 2024-03-01  
**Summary page:** https://www.summarizepaper.com/en/paper/2403.00910v1/

## Key points

- Quantum computing offers the potential to solve complex problems beyond classical computers
- Simulating nonequilibrium dynamics of magnetic spin systems undergoing quantum phase transitions is a challenging task
- Superconducting quantum annealing processors have shown promising results in generating samples aligning with solutions from the Schrödinger equation
- Quantum annealers exhibit area-law scaling of entanglement in spin glass models across dimensions
- Comparison with approximate methods shows quantum annealers outperform existing approaches in accuracy within a reasonable timeframe
- Quantum computers have unique capabilities to address practical questions beyond classical computing systems
- Research highlights computational supremacy of quantum simulation in tackling intricate problems like nonequilibrium dynamics in magnetic spin systems
- Implications suggest quantum computers may unlock new frontiers in scientific research and problem-solving previously unattainable using classical computing methodologies

## Summary

In the realm of quantum computing, the potential for solving complex problems that are beyond the capabilities of classical computers is a tantalizing prospect. One such challenge lies in simulating the nonequilibrium dynamics of a magnetic spin system undergoing a quantum phase transition. This task stretches the limits of traditional computational methods due to exponential resource requirements as system size grows. However, recent advancements in superconducting quantum annealing processors have shown promising results in rapidly generating samples that closely align with solutions derived from the Schrödinger equation. In a groundbreaking study led by Andrew D. King, Alberto Nocera, and their team of esteemed researchers (including Marek M. Rams and Jacek Dziarmaga), it was demonstrated that these quantum annealers exhibit area-law scaling of entanglement in various spin glass models across different dimensions. The research further delves into comparing these quantum annealing results with approximate methods based on tensor networks and neural networks. The conclusion drawn is striking: no existing approach can match the accuracy achieved by quantum annealers within a reasonable timeframe. This finding underscores the unique capability of quantum computers to address practical questions that remain out of reach for classical computing systems. With contributions from an extensive list of collaborators including Roeland Wiersema, William Bernoudy, and Jack Raymond among others, this study sheds light on the computational supremacy exhibited by quantum simulation in tackling intricate problems like nonequilibrium dynamics in magnetic spin systems. The implications are profound, pointing towards a future where quantum computers may unlock new frontiers in scientific research and problem-solving that were previously deemed unattainable using classical computing methodologies.