• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
From Simulatability to Universality of Continuous-Variable Quantum Computers

From Simulatability to Universality of Continuous-Variable Quantum Computers

Hardcover

Series: Springer Theses

General ComputersGeneral SciencePhysics

PREORDER - Expected ship date February 24, 2027

ISBN10: 3032369193
ISBN13: 9783032369192
Publisher: Springer
Published: Feb 24 2027
Pages: 99
Language: English
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.

Also in

General Computers