78 citations · 217 across the 28 of their papers we have counts for
7 papers · 1 filter
Pooling Representation Autoencoders for Efficient Diffusion
Ramón Calvo-González, Youssef Saied, François Fleuret
Representation Autoencoders (RAEs) generate images from pre-trained visual fea- tures, but their dense token grids make generative modeling expensive. Motivated by local feature co…
Topology-Dependent Enhancement of Entanglement Extraction in Repeater Graph States
Poramat Chianvichai, Poramet Pathumsoot, Naphan Benchasattabuse +3
Quantum repeaters are essential for establishing long-distance quantum communication to overcome the exponential decay of entanglement due to photon loss. Traditional repeater arch…
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,…
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…