Quantum advantage reassessed: More realistic benchmarks for quantum algorithms

Quantum advantage, or the point at which a quantum computer outperforms classical computers in solving specific tasks, remains elusive for many practical applications. Researchers often rely on theoretical models and simulations to predict when and under what conditions this advantage may materialize. One promising approach is quantum simulation, but existing methods in quantum chemistry rely on simplifying assumptions such as closed systems, unitary dynamics, and the Born-Oppenheimer approximation.

These assumptions fail to capture the complexities of real-world molecular interactions and environmental influences.

A recent review titled "Beyond Unitary Quantum Simulation: Open-System Approaches for Quantum Chemistry Toward Quantum Advantage" challenges the traditional approach to quantum chemistry. Co-authored by experts from industry, academia, and applied research, the review advocates for a shift in perspective, emphasizing the importance of open-system dynamics in quantum chemistry.

Instead of viewing dissipation and open-system dynamics as disturbances, the authors argue that they can be harnessed as resources for quantum algorithms. This perspective is crucial for understanding chemically relevant quantum states and could lead to genuine quantum advantage in practical applications.

The review contributes to a broader research context that connects open quantum systems, dissipative state preparation, and engineered dissipation with current discussions on fault-tolerant quantum algorithms, quantum machine learning, and the Quantum Approximate Optimization Algorithm (QAOA). The authors emphasize that quantum computers should be tested under realistic conditions rather than relying on idealized models.

This shift in approach could pave the way for more reliable evidence of genuine quantum advantage in various fields, including finance, logistics, network planning, materials design, and machine learning.

Another related publication, "Extrapolation method to optimize linear-ramp quantum approximate optimization algorithm parameters: Evaluation of runtime scaling," published in Physical Review A, focuses on optimizing the QAOA algorithm for combinatorial problems. The study demonstrates that under certain conditions, QAOA may exhibit computational cost advantages over classical methods for larger problem sizes.

By extrapolating algorithm parameters from small to large problem sizes, the research provides valuable insights into the scalability of quantum algorithms. The findings suggest that as problem sizes increase, quantum algorithms could become more efficient than classical ones, moving quantum computing closer to practical applicability.