Related papers: Asymptotically Optimal Topological Quantum Compili…
We propose a novel optimization scheme designed to find optimally correctable subspace codes for a known quantum noise channel. To each candidate subspace code we first associate a universal recovery map, as if the code was perfectly…
To implement quantum algorithms on a quantum computer, we must overcome the twin problems of fault-tolerance -- how can we realize a relatively noiseless computation by cleverly combining noisy components? -- and compilation -- how can we…
While the realization of scalable quantum computation will arguably require topological stabilization and, with it, topological-hardware-aware quantum programming and topological-quantum circuit verification, the proper combination of these…
Read-Rezayi fractional quantum Hall states are among the prime candidates for realizing non-Abelian anyons which in principle can be used for topological quantum computation. We present a prescription for efficiently finding braids which…
Fault-tolerant quantum computing typically requires the transpilation of arbitrary quantum circuits into a finite, universal gate set, such as Clifford+T. As a baseline, Diagonal approximation can be used for synthesizing single-qubit Pauli…
We study fault-tolerant error correction in a quantum memory constructed as a two-dimensional model of Fibonacci anyons on a torus, in the presence of thermal noise represented by pair-creation processes and measurement errors. The…
Quantum approximate optimization is one of the promising candidates for useful quantum computation, particularly in the context of finding approximate solutions to Quadratic Unconstrained Binary Optimization (QUBO) problems. However, the…
Quantum compilation provides a method to translate quantum algorithms at a high level of abstraction into their implementations as quantum circuits on real hardware. One approach to quantum compiling is to design a parameterised circuit and…
Executing quantum algorithms using Majorana zero modes - a major milestone for the field of topological quantum computing - requires a platform that can be scaled to large quantum registers, can be controlled in real time and space, and a…
I point out that a possible minimal setting to realize Kitaev's proposal of a Topological Quantum Computation which offers topological protection from decoherence could in principle be realized by braided Majorana qubits. Majorana qubits…
We provide an efficient algorithm to compile quantum circuits for fault-tolerant execution. We target surface codes, which form a 2D grid of logical qubits with nearest-neighbor logical operations. Embedding an input circuit's qubits in…
This paper proposes a novel deep learning-based error correction coding scheme for AWGN channels under the constraint of one-bit quantization in the receivers. Specifically, it is first shown that the optimum error correction code that…
We show that quasicrystals exhibit anyonic behavior that can be used for topological quantum computing. In particular, we study a correspondence between the fusion Hilbert spaces of the simplest non-abelian anyon, the Fibonacci anyons, and…
This review presents an entry-level introduction to topological quantum computation -- quantum computing with anyons. We introduce anyons at the system-independent level of anyon models and discuss the key concepts of protected fusion…
Quantum computing is a promising paradigm that may overcome the current computational power bottlenecks. The increasing maturity of quantum processors provides more possibilities for the development and implementation of quantum algorithms.…
We propose two different implementations of an asymmetric two-output probabilistic quantum processor, which can implement a restricted set of one-qubit operations. One of them is constructed by combining asymmetric telecloning with a…
We propose a scheme for scalable and robust quantum computing on two-dimensional arrays of qubits with fixed longitudinal coupling. This opens the possibility for bypassing the device complexity associated with tunable couplers required in…
We consider universal statistical properties of systems that are characterized by phase states with macroscopic degeneracy of the ground state. A possible topological order in such systems is described by non-linear discrete equations. We…
Creating and manipulating anyons and symmetry defects in topological phases, especially those with a non-Abelian character, constitutes a primitive for topological quantum computation. We provide a physical protocol for implementing the…
We consider a two-dimensional quantum memory of qubits on a torus which encode the extended Fibonaccistring-net code, and devise strategies for error correction when those qubits are subjected to depolarizing noise.Building on the concept…