Zobrazeno 1 - 10
of 888
pro vyhledávání: '"Leverrier, A."'
Quantum low-density parity-check (qLDPC) codes are a promising construction for drastically reducing the overhead of fault-tolerant quantum computing (FTQC) architectures. However, all of the known hardware implementations of these codes require adva
Externí odkaz:
http://arxiv.org/abs/2401.09541
Autor:
Leverrier, Anthony
The goal of this note is to explain the reconciliation problem for continuous-variable quantum key distribution protocols with a discrete modulation. Such modulation formats are attractive since they significantly simplify experimental implementation
Externí odkaz:
http://arxiv.org/abs/2310.17548
Publikováno v:
Quantum 8, 1337 (2024)
Between NISQ (noisy intermediate scale quantum) approaches without any proof of robust quantum advantage and fully fault-tolerant quantum computation, we propose a scheme to achieve a provable superpolynomial quantum advantage (under some widely acce
Externí odkaz:
http://arxiv.org/abs/2307.10729
Autor:
Denys, Aurélie, Leverrier, Anthony
Given some group $G$ of logical gates, for instance the Clifford group, what are the quantum encodings for which these logical gates can be implemented by simple physical operations, described by some physical representation of $G$? We study this que
Externí odkaz:
http://arxiv.org/abs/2306.11621
Autor:
Denys, Aurélie, Leverrier, Anthony
Publikováno v:
Quantum 7, 1032 (2023)
Quantum computers often manipulate physical qubits encoded on two-level quantum systems. Bosonic qubit codes depart from this idea by encoding information in a well-chosen subspace of an infinite-dimensional Fock space. This larger physical space pro
Externí odkaz:
http://arxiv.org/abs/2210.16188
Autor:
Leverrier, Anthony, Zémor, Gilles
We introduce sequential and parallel decoders for quantum Tanner codes. When the Tanner code construction is applied to a sufficiently expanding square complex with robust local codes, we obtain a family of asymptotically good quantum low-density par
Externí odkaz:
http://arxiv.org/abs/2208.05537
Publikováno v:
Quantum 8, 1450 (2024)
We propose a decoder for the correction of erasures with hypergraph product codes, which form one of the most popular families of quantum LDPC codes. Our numerical simulations show that this decoder provides a close approximation of the maximum likel
Externí odkaz:
http://arxiv.org/abs/2208.01002
Autor:
Roumestan, François, Ghazisaeidi, Amirhossein, Renaudier, Jérémie, Vidarte, Luis Trigo, Leverrier, Anthony, Diamanti, Eleni, Grangier, Philippe
Publikováno v:
Journal of Lightwave Technology 42(15), 5182 (2024)
Quantum key distribution (QKD) enables the establishment of secret keys between users connected via a channel vulnerable to eavesdropping, with information-theoretic security, that is, independently of the power of a malevolent party. QKD systems bas
Externí odkaz:
http://arxiv.org/abs/2207.11702
Autor:
Leverrier, Anthony, Zémor, Gilles
Publikováno v:
Proceedings of SODA 2023
We introduce and analyse an efficient decoder for the quantum Tanner codes of that can correct adversarial errors of linear weight. Previous decoders for quantum low-density parity-check codes could only handle adversarial errors of weight $O(\sqrt{n
Externí odkaz:
http://arxiv.org/abs/2206.07571
Autor:
Leverrier, Anthony, Zémor, Gilles
Tanner codes are long error correcting codes obtained from short codes and a graph, with bits on the edges and parity-check constraints from the short codes enforced at the vertices of the graph. Combining good short codes together with a spectral ex
Externí odkaz:
http://arxiv.org/abs/2202.13641