3 papers
quant-ph2026
Asymptotic Compression of Interactive Quantum Communication using Type-Constrained de Finetti Reduction
Louis Desruisseaux, Simon Ducharme, Gurleen Padda +1
For many information processing tasks, de Finetti-style theorems can often simplify the analysis in worst-case input scenarios for which the task exhibits some permutation-invarian…
cs.IT2025
Round-Preserving Asymptotic Compression of Prior-Free Interactive Protocols
Gurleen Padda, Dave Touchette
There is a close relationship between the communication complexity and information complexity of communication problems, as demonstrated by results such as Shannon's noiseless sour…
quant-ph2023
Improving Qubit Routing by Using Entanglement Mediated Remote Gates
Gurleen Padda, Edwin Tham, Aharon Brodutch +1
Near-term quantum computers often have connectivity constraints, i.e. restrictions, on which pairs of qubits in the device can interact. Optimally mapping a quantum circuit to a ha…