13 papers
Promise and Challenges of Distimation
Joshua Carlo A. Casapao, Ananda G. Maity, Naphan Benchasattabuse +4
Estimating the quality of raw entangled states and distilling high-fidelity entanglement traditionally require two separate link-layer protocols in a quantum network stack, each co…
Structure-Informed Multiple Sequence Alignment: A Formal Model and Hardness Results
Yoshiki Kanazawa, Naphan Benchasattabuse, Michal Hajdušek +1
We formulate a structure-informed multiple sequence alignment problem, denoted MSA-S. The model abstracts biological sequences as strings and structural information as designated p…
Resource Management in Heterogeneous Quantum Repeater Networks
Naphan Benchasattabuse
In this thesis, I explore whether it is possible to build a unified Quantum Internet architecture that supports different types of quantum repeaters -- especially the two most dist…
Space-Time Tradeoffs of Pauli-Based Computation in Distributed qLDPC Architectures
Naphan Benchasattabuse, Michal Hajdušek, Rodney Van Meter
Pauli-based computation (PBC) provides a universal framework for executing fault-tolerant quantum algorithms using Pauli measurements and magic states. In monolithic architectures,…
Architecture and protocols for all-photonic quantum repeaters
Naphan Benchasattabuse, Michal Hajdušek, Rodney Van Meter
The all-photonic quantum repeater scheme, utilizing a type of graph state called the repeater graph state (RGS), promises resilience to photon losses and operational errors, offeri…
Quantum Hamlets: Distributed Compilation of Large Algorithmic Graph States
Anthony Micciche, Naphan Benchasattabuse, Andrew McGregor +3
We investigate the problem of compiling the generation of graph states to arbitrarily many distributed homogeneous quantum processing units (QPUs), providing a scalable partitionin…