The work proves a worst-case sample complexity of O(sqrt(4.5^n)) for distributed inner product estimation with local Clifford sampling on n-qubit states, with a conjectured O(sqrt(3.6^n)) for Haar sampling.
Title resolution pending
4 Pith papers cite this work. Polarity classification is still indexing.
citation-role summary
citation-polarity summary
fields
quant-ph 4years
2026 4verdicts
UNVERDICTED 4roles
background 2polarities
background 2representative citing papers
Superconducting circuits generate and transfer microwave photons in three mutually orthogonal temporal modes over 30 m, enabling selective absorption at the receiver with 40:1 contrast.
The [[144,12,12]] bivariate bicycle code is distributed across 4 to 12 processors in a star network, with simulations showing logical error rates under varying nonlocal noise scaling.
A distributed switching protocol for unbuffered quantum networks uses cooperative BSA selection and bi-path reservations to achieve high link success rates under load in simulations.
citing papers explorer
-
Worst-Case Sample Complexity Bounds for Distributed Inner Product Estimation with Local Randomized Measurements
The work proves a worst-case sample complexity of O(sqrt(4.5^n)) for distributed inner product estimation with local Clifford sampling on n-qubit states, with a conjectured O(sqrt(3.6^n)) for Haar sampling.
-
Emission and Absorption of Microwave Photons in Orthogonal Temporal Modes across a 30-Meter Two-Node Network
Superconducting circuits generate and transfer microwave photons in three mutually orthogonal temporal modes over 30 m, enabling selective absorption at the receiver with 40:1 contrast.
-
Distributed Quantum Error Correction with Bivariate Bicycle Codes in a Modular Architecture
The [[144,12,12]] bivariate bicycle code is distributed across 4 to 12 processors in a star network, with simulations showing logical error rates under varying nonlocal noise scaling.
-
A Distributed Switching Protocol for Quantum Networks
A distributed switching protocol for unbuffered quantum networks uses cooperative BSA selection and bi-path reservations to achieve high link success rates under load in simulations.