Story perspectives

New Study Challenges Superiority of Continuous-Variable Quantum Computers

10/14/2025

Summary

Story summary

Researchers from Chalmers University of Technology and the Technical University of Denmark find that gate-based continuous-variable quantum computers do not offer a superpolynomial advantage over discrete-variable systems.
They establish a framework to map quantum circuits between continuous- and discrete-variable paradigms, showing continuous-variable computations can be efficiently simulated by discrete-variable devices.
The findings challenge the presumed superiority of continuous-variable systems and highlight energy constraints as a key factor in quantum computation.

History

Historical Context

In 1981, Richard Feynman proposed that classical computers struggle to simulate quantum systems efficiently, laying the foundation for quantum computing. However, a 2023 study from Chalmers University and the Technical University of Denmark revealed that gate-based continuous-variable quantum computers do not outperform discrete-variable systems, challenging earlier assumptions about quantum superiority and highlighting ongoing limitations in practical applications of quantum technology.

1 of 2

Story summary

Researchers from Chalmers University of Technology and the Technical University of Denmark find that gate-based continuous-variable quantum computers do not offer a superpolynomial advantage over discrete-variable systems.
They establish a framework to map quantum circuits between continuous- and discrete-variable paradigms, showing continuous-variable computations can be efficiently simulated by discrete-variable devices.
The findings challenge the presumed superiority of continuous-variable systems and highlight energy constraints as a key factor in quantum computation.

1 / 2