From the 1 of 5.5k papers with an AI index.
- Centre National de la Recherche ScientifiqueFR1.7k papers
- Centre Inria de SaclayFR364 papers
- École PolytechniqueFR306 papers
- Laboratoire Lorrain de Recherche en Informatique et ses ApplicationsFR300 papers
- École Normale Supérieure - PSLFR292 papers
- Sorbonne UniversitéFR291 papers
- École Normale Supérieure de LyonFR233 papers
- Centre Inria de l'Université Grenoble AlpesFR216 papers
- Université Paris-SaclayFR208 papers
- Université Grenoble AlpesFR204 papers
- Lyon 1 UniversitéFR191 papers
- Centre Inria d'Université Côte d'AzurFR183 papers
19 papers · 2 filters
Dynamically protected cat-qubits: a new paradigm for universal quantum computation
Mazyar Mirrahimi, Zaki Leghtas, Victor V. Albert +4
We present a new hardware-efficient paradigm for universal quantum computation which is based on encoding, protecting and manipulating quantum information in a quantum harmonic osc…
Tracking Photon Jumps with Repeated Quantum Non-Demolition Parity Measurements
L. Sun, A. Petrenko, Z. Leghtas +11
Quantum error correction (QEC) is required for a practical quantum computer because of the fragile nature of quantum information. In QEC, information is redundantly stored in a lar…
Exploring the Local Orthogonality Principle
A. B. Sainz, T. Fritz, R. Augusiak +4
Nonlocality is arguably one of the most fundamental and counterintuitive aspects of quantum theory. Nonlocal correlations could, however, be even more nonlocal than quantum theory…
Extending robustness & randomization from Consensus to Symmetrization Algorithms
Luca Mazzarella, Francesco Ticozzi, Alain Sarlette
This work interprets and generalizes consensus-type algorithms as switching dynamics leading to symmetrization of some vector variables with respect to the actions of a finite grou…
Time-optimal control of SU(2) quantum operations
A. Garon, S. J. Glaser, D. Sugny
We propose an analysis of the time-optimal control of SU(2) quantum operations. By using the Pontryagin Maximum Principle, we show how to determine the optimal trajectory reaching…
Lower Bounds on the Communication Complexity of Binary Local Quantum Measurement Simulation
Adrian Kosowski, Marcin Markiewicz
We consider the problem of the classical simulation of quantum measurements in the scenario of communication complexity. Regev and Toner (2007) have presented a 2-bit protocol whic…