Related papers: Continuous-Variable Quantum MacWilliams Identities
In the present paper we introduce and study finite point subsets of a special kind, called optimum distributions, in the n-dimensional unit cube. Such distributions are closely related with known (delta,s,n)-nets of low discrepancy. It…
We derive simplified sphere-packing and Gilbert--Varshamov bounds for codes in the sum-rank metric, which can be computed more efficiently than previous ones. They give rise to asymptotic bounds that cover the asymptotic setting that has…
Using a technique based on quantum teleportation, we simplify the most general adaptive protocols for key distribution, entanglement distillation and quantum communication over a wide class of quantum channels in arbitrary dimension. Thanks…
Equilibrium particle densities near a hard wall are studied for a quantum fluid made of point charges which interact via Coulomb potential without any regularization. In the framework of the grand-canonical ensemble, we use an equivalence…
To produce an operable quantum computer that is made with imperfect hardware, we must design and test scalable quantum error correcting codes that are suited for the devices we can build and, in unison, develop decoding strategies that…
The sphere packing bound, in the form given by Shannon, Gallager and Berlekamp, was recently extended to classical-quantum channels, and it was shown that this creates a natural setting for combining probabilistic approaches with some…
The sphere packing bound, in the form given by Shannon, Gallager and Berlekamp, was recently extended to classical-quantum channels, and it was shown that this creates a natural setting for combining probabilistic approaches with some…
An experimental success criterion for continuous-variable quantum teleportation and memories is to surpass a limit of the average fidelity achieved by the classical measure-and-prepare schemes with respect to a Gaussian distributed set of…
We study fluctuations of mean-field interacting particle systems around their McKean--Vlasov limit. Our main result provides a uniform-in-time quantitative central limit theorem for the fluctuation process, with convergence rate of order…
Motivated by the application of point-to-point communication networks and biological storage, we investigate new achievability bounds for noisy permutation channels with strictly positive and full-rank square matrices. Our new bounds use…
Quantum computers have long been expected to efficiently solve complex classical differential equations. Most digital, fault-tolerant approaches use Carleman linearization to map nonlinear systems to linear ones and then apply quantum…
Quantum key distribution (QKD) enables two remote parties to share encryption keys with security based on the laws of physics. Continuous variable (CV) QKD with coherent states and coherent detection integrates well with existing…
The Heisenberg limit provides a quadratic improvement over the standard quantum limit, and is the maximum quantum advantage that quantum sensors could provide over classical methods. This limit remains elusive, however, because of the…
Finding the solution to linear ordinary differential equations of the form $\partial_t u(t) = -A(t)u(t)$ has been a promising theoretical avenue for \textit{asymptotic} quantum speedups. However, despite the improvements to existing quantum…
In this note we report two versions of Gilbert-Varshamov type existential bounds for asymmetric quantum error-correcting codes.
We present a continuous-variable quantum key distribution protocol combining a continuous but slightly non-Gaussian modulation together with a efficient reverse reconciliation scheme. We establish the security of this protocol against…
Continuous-variable quantum key distribution (CV-QKD) is realized with coherent detection and is therefore very suitable for a cost-efficient implementation. The major challenge in CV-QKD is mitigation of laser phase noise at a signal to…
We consider the task of performing shadow tomography of a logical subsystem defined via the Gottesman-Kitaev-Preskill (GKP) error correcting code. Our protocol does not require the input state to be a code state but is implemented by…
Defining metrics for near-term quantum computing processors has been an integral part of the quantum hardware research and development efforts. Such quantitative characteristics are not only useful for reporting the progress and comparing…
In order to achieve fault-tolerant quantum computing, we make use of quantum error correction schemes designed to protect the logical information of the system from decoherence. A promising way to preserve such information is to use the…