Related papers: Streamlined quantum computing with macronode clust…
One-way quantum computation is a promising approach to achieving universal, scalable, and fault-tolerant quantum computation. However, a main challenge lies in the creation of universal, scalable three-dimensional cluster states. Here, an…
Bosonic fault tolerant quantum computing requires preparations of Bosonic code states like cat states and GKP states with high fidelity and reliable quantum certification of these states. Although many proposals on preparing these states…
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…
We present results illustrating the construction of 3D topological cluster states with coherent state logic. Such a construction would be ideally suited to wave-guide implementations of quantum optical processing. We investigate the use of…
Encoding a qubit in the continuous degrees of freedom of an oscillator is a promising path to error-corrected quantum computation. One advantageous way to achieve this is through Gottesman-Kitaev-Preskill (GKP) grid states, whose symmetries…
Continuous-variable (CV) systems have shown remarkable potential for quantum computation, particularly excelling in scalability and error correction through bosonic encoding. Within this framework, the foundational notion of computational…
We present a detailed description of an architecture for fault-tolerant quantum computation, which is based on the cluster model of encoded qubits. In this cluster-based architecture, concatenated computation is implemented in a quite…
In order to achieve fault-tolerant quantum computation, we need to repeat the following sequence of four steps: First, perform 1 or 2 qubit quantum gates (in parallel if possible). Second, do a syndrome measurement on a subset of the…
Physical Gottesman-Kitaev-Preskill (GKP) states are inherently noisy as ideal ones would require infinite energy. While this is typically considered as a deficiency to be actively corrected, this work demonstrates that imperfect GKP…
Straightforward logical operations contrasting with complex state preparation are the hallmarks of the bosonic encoding proposed by Gottesman, Kitaev and Preskill (GKP). The recently reported generation and error-correction of GKP qubits in…
Quantum computers are expected to bring drastic acceleration to several computing tasks against classical computers. Noisy intermediate-scale quantum (NISQ) devices, which have tens to hundreds of noisy physical qubits, are gradually…
Quantum computation with light, compared with other platforms, offers the unique benefit of natural high-speed operations at room temperature and large clock rate, but a big obstacle of photonics is the lack of strong nonlinearities which…
Today ion traps are among the most promising physical systems for constructing a quantum device harnessing the computing power inherent in the laws of quantum physics. The standard circuit model of quantum computing requires a universal set…
GKP codes encode a qubit in displaced phase space combs of a continuous-variable (CV) quantum system and are useful for correcting a variety of high-weight photonic errors. Here we propose atomic ensemble analogues of the single-mode CV GKP…
Gottesman-Kitaev-Preskill (GKP) codes are a promising candidate for implementing fault tolerant quantum computation in quantum harmonic oscillator systems such as superconducting resonators, optical photons and trapped ions, and in recent…
(Abridged.) This thesis investigates scalable fault-tolerant quantum computation through the development of bosonic quantum codes, quantum LDPC codes, and decoding protocols that connect continuous-variable and discrete-variable error…
The immense scalability of continuous-variable cluster states motivates their study as a platform for quantum computing, with fault tolerance possible given sufficient squeezing and appropriately encoded qubits [Menicucci, PRL 112, 120504…
Fault tolerant quantum computing methods which work with efficient quantum error correcting codes are discussed. Several new techniques are introduced to restrict accumulation of errors before or during the recovery. Classes of eligible…
Error correcting codes protect quantum information and form the basis of fault tolerant quantum computing. Leading proposals for fault-tolerant quantum computation require codes with an exceedingly rare property, a transverse non-Clifford…
High-rate and large-distance quantum codes are expected to make fault-tolerant quantum computing more efficient, but most of them lack efficient fault-tolerant encoded-state preparation methods. We propose such a fault-tolerant encoder for…