From Simulatability to Universality of Continuous-Variable Quantum Computers

Erscheinungsjahr 2026
ISBN: 978-3-032-36919-2
Verlag: Springer

Buch, Englisch, 99 Seiten, Format (B × H): 155 mm x 235 mm

Reihe: Springer Theses

This book makes a significant contribution to the field of quantum computing by exploring the boundary between classical and quantum computational power. While quantum computers offer a revolutionary approach to solving complex problems, we still do not fully understand which problems will benefit from the power of quantum computing. This book explores this question by demonstrating that large classes of quantum circuits can be simulated efficiently on a classical computer. The primary focus of the thesis is on a specific type of quantum computing, namely, continuous-variable quantum computing. This approach, which operates with continuous ranges of values, similar to how analogue systems can represent any value within a range, is a promising direction for the future of computing. Previous studies have demonstrated that when a quantum algorithm contains certain features, it implies that a classical device can achieve the same results in approximately the same time. However, this book turns these results on their head, instead demonstrating that certain quantum algorithms do not fit the previous criteria and can still be easily simulated by classical devices. The book also identifies a theoretically grounded condition that proves that algorithms satisfying the condition is always able to achieve an advantage over classical devices.

Zielgruppe

Research

Autoren/Hrsg.

Calcluth, Cameron

Fachgebiete

• Naturwissenschaften Physik Quantenphysik
• Interdisziplinäres Wissenschaften Wissenschaften: Forschung und Information Kybernetik, Systemtheorie, Komplexe Systeme
• Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker

Inhaltsverzeichnis

Introduction.- Background.- Simulation of ideal Gottesman-Kitaev-Preskill states.- Simulation of realistic Gottesman-Kitaev-Preskill states.- A framework for universality in continuous-variable quantum computation.- Conclusion.

Über Autor(innen)

Cameron Calcluth’s research focus is on theoretical quantum information and quantum computation. In 2026, Cameron Calcluth began a Wenner-Gren fellowship to work at the Mathematical Institute at the University of Oxford for three years, having completed his Ph.D at Chalmers University of Technology in 2025. His Ph.D., supervised by Prof Giulia Ferrini, explored the boundary of simulatability and quantum advantage in the context of continuous-variable quantum computers. Cameron’s research has established new criteria for when quantum algorithms outperform classical ones and has contributed to unifying discrete- and continuous-variable approaches within a single framework. Cameron’s long-term research goal is to clarify the fundamental limits between quantum and classical computation in order to inform the design of practical quantum algorithms and devices.