Simulating quantum circuits with restricted quantum computers
OPEN ACCESS
Loading...
Author / Producer
Date
2025
Publication Type
Doctoral Thesis
ETH Bibliography
yes
Citations
Altmetric
OPEN ACCESS
Data
Rights / License
Abstract
It is one of the most fundamental objectives in quantum information science to understand the boundary between the computational power of classical and quantum computers. One possible avenue to explore this boundary is to identify classes of quantum circuits that can be efficiently simulated on a classical computer. In recent years, this idea has been extended one step further:
Instead of simulating a general quantum circuit with a classical device, new schemes have emerged to simulate them on a quantum device that is restricted in some manner. As such, these techniques allow us to study how the restrictions impact the computational power of the device. One such technique is called quasiprobability simulation (QPS) and it estimates the result of a quantum circuit with a Monte Carlo procedure that randomly replaces circuit elements with ones that can be executed on the restricted quantum device.
The main focus of this thesis is dedicated to the QPS-based simulation of nonlocal quantum computation using local quantum operations. On the practical side, this enables the simulation of large quantum circuits using multiple smaller quantum devices - a procedure that is sometimes called circuit knitting. We uncover a rich mathematical formalism with many connections to the resource theory of entanglement. We characterize the optimal simulation overhead for a broad range of practically relevant nonlocal states and channels and we explicitly provide achieving protocols. Moreover, we also investigate the utility of classical communication between the local parties. Our results address both the single-shot and asymptotic regime.
Furthermore, this thesis also presents a comprehensive overview of recent developments of QPS. Besides the simulation of nonlocal computation, we also investigate the simulation of magic computation with a Clifford device, the simulation noise-free computation with a noisy device as well as the simulation of nonphysical operations. We frame QPS in a quantum resource theoretic framework, which highlights similarities that arise in the different instantiations of the technique. Furthermore, we study the importance of classical side information in the QPS procedure and how it impacts the overhead and expressibility of QPS.
Overall, this thesis provides a self-contained introduction for researchers interested in learning about circuit knitting and QPS.
Permanent link
Publication status
published
External links
Editor
Contributors
Book title
Journal / series
Volume
Pages / Article No.
Publisher
ETH Zurich
Event
Edition / version
Methods
Software
Geographic location
Date collected
Date created
Subject
Quantum information theory; quantum computing; quantum resource theories; circuit knitting; Quantum information theory; Quantum computing; Quantum resource theories; Circuit knitting
Organisational unit
03781 - Renner, Renato / Renner, Renato