Related papers: Logical network implementation for cluster states …
Designs for quantum error correction depend strongly on the connectivity of the qubits. For solid state qubits, the most straightforward approach is to have connectivity constrained to a planar graph. Practical considerations may also…
Graph states have been used for quantum error correction by Schlingemann et al. [Physical Review A 65.1 (2001): 012308]. Hypergraph states [Physical Review A 87.2 (2013): 022311] are generalizations of graph states and they have been used…
The development of quantum codes with good error correction parameters and useful sets of transversal gates is a problem of major interest in quantum error-correction. Abundant prior works have studied transversal gates which are restricted…
Continuous-variable quad-rail lattice cluster states enable flexible quantum circuit design on their two-dimensional structure. However, how to combine basic operations on the quad-rail lattice cluster state to realize multimode operations…
We propose using even and odd Sch\"odinger cat states formed from coherent states of U(3) of an ensemble of qutrits with a symmetrical V-configuration (a qubit-disguised qutrit) to encode a logical qubit. These carefully engineered logical…
The concrete schemes to realize three types of basic quantum logical gates using linear quadripartite cluster states of optical continuous variables are proposed. The influences of noises and finite squeezing on the computation precision…
Deciding if a given family of quantum states is topologically ordered is an important but nontrivial problem in condensed matter physics and quantum information theory. We derive necessary and sufficient conditions for a family of graph…
We take initial steps towards a general framework for constructing logical gates in general quantum CSS codes. Viewing CSS codes as cochain complexes, we observe that cohomology invariants naturally give rise to diagonal logical gates. We…
With the advent of physical qubits exhibiting strong noise bias, it becomes increasingly relevant to identify which quantum gates can be efficiently implemented on error-correcting codes designed to address a single dominant error type.…
Floquet codes have recently emerged as a new family of error-correcting codes, and have drawn significant interest across both theoretical and practical quantum computing. A central open question has been how to implement logical operations…
A method for the implementation of a universal set of fault-tolerant logical gates is presented using homological product codes. In particular, it is shown that one can fault-tolerantly map between different encoded representations of a…
Scalable quantum computing and communication requires the protection of quantum information from the detrimental effects of decoherence and noise. Previous work tackling this problem has relied on the original circuit model for quantum…
Topological measurement-based quantum computation (MBQC) enables one to carry out universal fault-tolerant quantum computation via single-qubit Pauli measurements with a family of large entangled states called cluster states as resources.…
Quantum computation has suggested new forms of quantum logic, called quantum computational logics. The basic semantic idea is the following: the meaning of a sentence is identified with a quregister, a system of qubits, representing a…
We realize a suite of logical operations on a distance-two logical qubit stabilized using repeated error detection cycles. Logical operations include initialization into arbitrary states, measurement in the cardinal bases of the Bloch…
Quantum error-correcting codes with high encoding rate are good candidates for large-scale quantum computers as they use physical qubits more efficiently than codes of the same distance that encode only a few logical qubits. Some logical…
A fundamental problem in quantum information is to describe efficiently multipartite quantum states. An efficient representation in terms of graphs exists for several families of quantum states (graph, cluster, stabilizer states),…
A novel scheme is presented for fault-tolerant quantum computation based on the cluster model. Some relevant logical cluster states are constructed in concatenation by post-selection through verification, without necessity of recovery…
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…
For realizing a quantum memory we suggest to first encode quantum information via a quantum error correcting code and then concatenate combined decoding and re-encoding operations. This requires that the encoding and the decoding operation…