Zobrazeno 1 - 10
of 330
pro vyhledávání: '"Vuillot A"'
Continuous-variable cat codes are encodings into a single photonic or phononic mode that offer a promising avenue for hardware-efficient fault-tolerant quantum computation. Protecting information in a cat code requires measuring the mode's occupation
Externí odkaz:
http://arxiv.org/abs/2411.09668
We present an efficient algorithm to reduce the number of non-Clifford gates in quantum circuits and the number of parametrized rotations in parametrized quantum circuits. The method consists in finding rotations that can be merged into a single rota
Externí odkaz:
http://arxiv.org/abs/2407.07846
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
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
We formally define homological quantum rotor codes which use multiple quantum rotors to encode logical information. These codes generalize homological or CSS quantum codes for qubits or qudits, as well as linear oscillator codes which encode logical
Externí odkaz:
http://arxiv.org/abs/2303.13723
The Clifford$+T$ gate set is commonly used to perform universal quantum computation. In such setup the $T$ gate is typically much more expensive to implement in a fault-tolerant way than Clifford gates. To improve the feasibility of fault-tolerant qu
Externí odkaz:
http://arxiv.org/abs/2302.07040
We tackle the problem of Clifford isometry compilation, i.e, how to synthesize a Clifford isometry into an executable quantum circuit. We propose a simple framework for synthesis that only exploits the elementary properties of the Clifford group and
Externí odkaz:
http://arxiv.org/abs/2212.06928
Autor:
Vuillot, Christophe
A protocol called the "honeycomb code", or generically a "Floquet code", was introduced by Hastings and Haah in \cite{hastings_dynamically_2021}. The honeycomb code is a subsystem code based on the honeycomb lattice with zero logical qubits but such
Externí odkaz:
http://arxiv.org/abs/2110.05348
Publikováno v:
Quantum 6, 766 (2022)
We study a three-fold variant of the hypergraph product code construction, differing from the standard homological product of three classical codes. When instantiated with 3 classical LDPC codes, this "XYZ product" yields a non CSS quantum LDPC code
Externí odkaz:
http://arxiv.org/abs/2011.09746
We review some of the recent efforts in devising and engineering bosonic qubits for superconducting devices, with emphasis on the Gottesman-Kitaev-Preskill (GKP) qubit. We present some new results on decoding repeated GKP error correction using finit
Externí odkaz:
http://arxiv.org/abs/2002.11008