7 citations · 7 across the 6 of their papers we have counts for
20 papers · 1 filter
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…
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…
Efficient graph-diagonal characterization of noisy states distributed over quantum networks via Bell sampling
Zherui Jerry Wang, Joshua Carlo A. Casapao, Naphan Benchasattabuse +6
Graph states are an important class of entangled states that serve as a key resource for distributed information processing and communication in quantum networks. In this work, we…