4.6 Article

Strong no-go theorem for Gaussian quantum bit commitment

期刊

PHYSICAL REVIEW A
卷 81, 期 1, 页码 -

出版社

AMER PHYSICAL SOC
DOI: 10.1103/PhysRevA.81.010302

关键词

-

资金

  1. European Union [212008, 015848]
  2. Agence Nationale de la Recherche [ANR-07-SESU-011-01, ANR-08-EMER-012, ANR-09-JCJC-460290]
  3. Brussels-Capital Region

向作者/读者索取更多资源

Unconditionally secure bit commitment is forbidden by quantum mechanics. We extend this no-go theorem to continuous-variable protocols where both players are restricted to use Gaussian states and operations, which is a reasonable assumption in current-state optical implementations. Our Gaussian no-go theorem also provides a natural counter-example to a conjecture that quantum mechanics can be rederived from the assumption that key distribution is allowed while bit commitment is forbidden in Nature.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

Editorial Material Optics

Quantum key distribution and beyond: introduction

Mohsen Razavi, Anthony Leverrier, Xiongfeng Ma, Bing Qi, Zhiliang Yuan

JOURNAL OF THE OPTICAL SOCIETY OF AMERICA B-OPTICAL PHYSICS (2019)

Article Physics, Multidisciplinary

Asymptotic Security of Continuous-Variable Quantum Key Distribution with a Discrete Modulation

Shouvik Ghorai, Philippe Grangier, Eleni Diamanti, Anthony Leverrier

PHYSICAL REVIEW X (2019)

Article Computer Science, Hardware & Architecture

Constant Overhead Quantum Fault Tolerance with Quantum Expander Codes

Omar Fawzi, Antoine Grospellier, Anthony Leverrier

Summary: The paper investigates the asymptotic scaling of space overhead required for fault-tolerant quantum computation, showing that the polylogarithmic factor in the standard threshold theorem is unnecessary. A fault-tolerant construction is proposed that only uses a constant factor more qubits than the ideal computation. This result challenges the traditional concatenated code approach and suggests using quantum error-correcting codes with a constant encoding rate.

COMMUNICATIONS OF THE ACM (2021)

Article Quantum Science & Technology

Feasibility of satellite-to-ground continuous-variable quantum key distribution

Daniele Dequal, Luis Trigo Vidarte, Victor Roman Rodriguez, Giuseppe Vallone, Paolo Villoresi, Anthony Leverrier, Eleni Diamanti

Summary: Establishing secure communication links at a global scale using quantum information science is challenging but achievable, as shown by recent landmark experiments. Continuous-variable encoding in a satellite-to-ground downlink configuration can lead to positive secret key rates, especially in low-Earth-orbit scenarios, with limitations potentially arising in higher orbits due to finite-size effects. Our analysis helps determine parameters for successful secret key exchange and can guide further experimental efforts in this direction.

NPJ QUANTUM INFORMATION (2021)

Article Quantum Science & Technology

Combining hard and soft decoders for hypergraph product codes

Antoine Grospellier, Lucien Groues, Anirudh Krishna, Anthony Leverrier

Summary: This research introduces new hybrid decoders that combine the belief propagation algorithm with the small-set-flip (SSF) decoder to improve the decoding performance of quantum low-density parity-check (LDPC) codes. Numerical simulations show that the error threshold of these codes performs well under different conditions.

QUANTUM (2021)

Article Quantum Science & Technology

Explicit asymptotic secret key rate of continuous-variable quantum key distribution with an arbitrary modulation

Aurelie Denys, Peter Brown, Anthony Leverrier

Summary: The study establishes an analytical lower bound for continuous-variable quantum key distribution, supporting efficient modulation schemes and proposing a solution suitable for large-scale deployment.

QUANTUM (2021)

Article Computer Science, Theory & Methods

Quantum Distributed Complexity of Set Disjointness on a Line

Frederic Magniez, Ashwin Nayak

Summary: This research focuses on the number of rounds required for computing Set Disjointness in a distributed computing scenario with quantum processors, introducing the concept of "Set Disjointness on a Line" and providing an unconditional lower bound. It also connects the distributed computing scenario with a new query complexity model, demonstrating an algorithm for computing Set Disjointness in this model with round complexity matching the round lower bound.

ACM TRANSACTIONS ON COMPUTATION THEORY (2022)

Article Quantum Science & Technology

Quantum XYZ Product Codes

Anthony Leverrier, Simon Apers, Christophe Vuillot

Summary: This article introduces a variant of the three-dimensional hypergraph product code construction and explores the non-CSS quantum LDPC code and its related algebraic and combinatorial problems, aiming to find potential codes for self-correcting quantum memories.

QUANTUM (2022)

Article Quantum Science & Technology

Towards local testability for quantum coding

Anthony Leverrier, Vivien Londe, Gilles Zemor

Summary: This study introduces a new family of quantum codes called hemicubic codes. These codes are obtained by associating qubits with the faces of the n-cube and stabilizer constraints with faces of dimension (p +/- 1). The resulting quantum codes display local testability and a decoding algorithm is developed to correct errors. The study also explores the extension of this code family by considering the quotient of the n-cube by arbitrary linear classical codes. These hemicubic codes have potential applications in quantum computing.

QUANTUM (2022)

Proceedings Paper Computer Science, Information Systems

Linear programming decoder for hypergraph product quantum codes

Omar Fawzi, Lucien Groues, Anthony Leverrier

Summary: The decoder based on linear programming for quantum CSS codes has a different approach from previous definitions, but performs well in simulations, especially in hypergraph products, where it outperforms traditional methods.

2020 IEEE INFORMATION THEORY WORKSHOP (ITW) (2021)

Proceedings Paper Computer Science, Information Systems

Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model

Taisuke Izumi, Francois Le Gall, Frederic Magniez

37TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2020) (2020)

Article Computer Science, Theory & Methods

GOLDEN CODES: QUANTUM LDPC CODES BUILT FROM REGULAR TESSELLATIONS OF HYPERBOLIC 4-MANIFOLDS

Vivien Londe, Anthony Leverrier

QUANTUM INFORMATION & COMPUTATION (2019)

Article Optics

Composable security of two-way continuous-variable quantum key distribution without active symmetrization

Shouvik Ghorai, Eleni Diamanti, Anthony Leverrier

PHYSICAL REVIEW A (2019)

Proceedings Paper Computer Science, Theory & Methods

Improved bounds for testing Dyck languages

Eldar Fischer, Frederic Magniez, Tatiana Starikovskaya

SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (2018)

Proceedings Paper Computer Science, Hardware & Architecture

Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks

Francois Le Gall, Frederic Magniez

PODC'18: PROCEEDINGS OF THE 2018 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (2018)

暂无数据