A5070698248- Quantum Computing Algorithms and Architecture
- Quantum Information and Cryptography
- Quantum-Dot Cellular Automata
- Coding theory and cryptography
- GaN-based semiconductor devices and materials
- Plasma Diagnostics and Applications
- Quantum and electron transport phenomena
- Quantum Mechanics and Applications
- Advanced Data Storage Technologies
- Matrix Theory and Algorithms
- Low-power high-performance VLSI design
- Parallel Computing and Optimization Techniques
- Advanced Optimization Algorithms Research
- Error Correcting Code Techniques
- Tensor decomposition and applications
- Mathematical Analysis and Transform Methods
- Algebraic and Geometric Analysis
- Electronic and Structural Properties of Oxides
- Healthcare Systems and Practices
- Distributed and Parallel Computing Systems
- Physics of Superconductivity and Magnetism
- graph theory and CDMA systems
- Quantum many-body systems
- Distributed systems and fault tolerance
- Semiconductor Quantum Structures and Devices
Université de Lorraine
2023-2025
Laboratoire Lorrain de Recherche en Informatique et ses Applications
2023-2025
Centre National de la Recherche Scientifique
2023-2025
Centre Inria de l'Université de Lorraine
2022-2025
Future Earth
2021-2023
Sorbonne Université
2023
Université Paris Cité
2023
Université Paris Sciences et Lettres
2023
Sorbonne Paris Cité
2023
École Normale Supérieure
2023
The early Gottesman, Kitaev, and Preskill (GKP) proposal for encoding a qubit in an oscillator has recently been followed by cat- binomial-code proposals. Numerically optimized codes have also proposed, we introduce of this type here. These yet to be compared using the same error model; provide such comparison determining entanglement fidelity all with respect bosonic pure-loss channel (i.e., photon loss) after optimal recovery operation. We then compare achievable communication rates...
Abstract The main obstacle to large scale quantum computing are the errors present in every physical qubit realization. Correcting these requires a number of additional qubits. Two avenues reduce this overhead (i) low-density parity check (LDPC) codes requiring very few qubits correct (ii) cat where bit-flip exponentially suppressed by design. In work, we combine both approaches obtain an extremely low architecture. Assuming phase-flip error probability ϵ ≈ 0.1% per and operation, one...
We examine the performance of single-mode Gottesman-Kitaev-Preskill (GKP) code and its concatenation with toric for a noise model Gaussian shifts, or displacement errors. show how one can optimize tracking errors in repeated noisy error correction GKP code. do this by examining maximum-likelihood problem setting mapping onto 1D Euclidean path-integral modeling particle random cosine potential. demonstrate efficiency minimum-energy decoding strategy as proxy path integral evaluation. In...
Abstract We review some of the recent efforts in devising and engineering bosonic qubits for superconducting devices, with emphasis on Gottesman–Kitaev–Preskill (GKP) qubit. present new results decoding repeated GKP error correction using finitely-squeezed ancilla qubits, exhibiting differences previously studied stochastic models. discuss circuit-QED ways to realize CZ gates between we different scenarios regular as building blocks a scalable surface code architecture.
The large-scale execution of quantum algorithms requires basic operations to be implemented fault-tolerantly. most popular technique for accomplishing this, using the devices that can realised in near term, uses stabilizer codes which embedded a planar layout. set fault-tolerant executed these systems unitary gates is typically very limited. This has driven development measurement-based schemes performing logical codes, known as lattice surgery and code deformation. In parallel, gauge fixing...
We show how a hyperbolic surface code could be used for overhead-efficient quantum storage. give numerical evidence noise threshold of the -hyperbolic in phenomenological model (as compared with toric code). In this family, parity checks are weight 4 and 5, while each qubit participates four different checks. introduce family semi-hyperbolic codes that interpolate between terms encoding rate threshold. these outperform overhead target logical error probability. Dehn twists lattice surgery...
This paper reports on experiments realized several IBM~5Q chips which show evidence for the advantage of using error detection and fault-tolerant design quantum circuits. We an average improvement task sampling from states that can be fault-tolerantly prepared in [4,2,2] code, when a technique well suited to layout chip. By showing computation is already within our reach, author hopes encourage this approach.
Between NISQ (noisy intermediate scale quantum) approaches without any proof of robust quantum advantage and fully fault-tolerant computation, we propose a scheme to achieve provable superpolynomial (under some widely accepted complexity conjectures) that is noise with minimal error correction requirements. We choose class sampling problems commuting gates known as sparse IQP (Instantaneous Quantum Polynomial-time) circuits ensure its implementation by introducing the tetrahelix code. This...
We tackle the problem of Clifford isometry compilation, i.e, how to synthesize a into an executable quantum circuit. propose simple framework for synthesis that only exploits elementary properties group and one equation symplectic group. highlight versatility our by showing several normal forms literature are natural corollaries. recover state art two-qubit gate depth necessary execution circuit on LNN architecture, concomitantly with another work. also practical algorithms isometries focus...
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 known hardware implementations these require advanced technologies, such as long-range qubit connectivity, high-weight stabilizers, or multi-layered chip layouts. An alternative approach to reduce fault-tolerance is use bosonic cat qubits where bit-flip errors exponentially suppressed by design. In this work,...
The Clifford+ T gate set is commonly used to perform universal quantum computation. In such setup the typically much more expensive implement in a fault-tolerant way than Clifford gates. To improve feasibility of computing it then crucial minimize number Many algorithms, yielding effective results, have been designed address this problem. It has demonstrated that performing pre-processing step consisting reducing Hadamard gates circuit can help exploit full potential these algorithms and...
We study a three-fold variant of the hypergraph product code construction, differing from standard homological three classical codes. When instantiated with 3 LDPC codes, this "XYZ product" yields non CSS quantum which might display large minimum distance. The simplest instance corresponding to repetition is 3-dimensional toric known as Chamon code. general construction was introduced in Denise Maurice's PhD thesis, but has remained poorly understood so far. reason that while codes can be...
We introduce quantum pin codes: a class of CSS codes. Quantum codes are generalization color and Reed-Muller share lot their structure properties. Pin have gauge operators, an unfolding procedure stabilizers form so-called <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\ell $ </tex-math></inline-formula> -orthogonal spaces meaning that the joint overlap between any stabilizer elements is always even. This...
A protocol called the "honeycomb code", or generically a "Floquet was introduced by Hastings and Haah in \cite{hastings_dynamically_2021}. The honeycomb code is subsystem based on lattice with zero logical qubits but such that there exists schedule for measuring two-body gauge checks leaving enough room at all times two protected qubits. In this work we show way to introduce boundaries system which curiously presents rotating dynamics has constant distance therefore not fault-tolerant.
We tackle the problem of Clifford isometry compilation, i.e, how to synthesize a into an executable quantum circuit. propose simple framework for synthesis that only exploits elementary properties group and one equation symplectic group. highlight versatility our by showing several normal forms literature are natural corollaries. report improvement two-qubit depth necessary execution circuit on LNN architecture. also apply graph states codiagonalization Pauli rotations we improve 2-qubit...