Related papers: Phase-sensitive representation of Majorana stabili…
Stabilizer simulation can efficiently simulate an important class of quantum circuits consisting exclusively of Clifford gates. However, all existing extensions of this simulation to arbitrary quantum circuits including non-Clifford gates…
One of the key challenges in quantum information is coherently manipulating the quantum state. However, it is an outstanding question whether control can be realized with low error. Only gates from the Clifford group -- containing $\pi$,…
Clifford circuits play an important role in quantum computation. Gottesman and Chuang proposed a gate teleportation protocol so that a quantum circuit can be implemented by the teleportation circuit with specific ancillary qubits. In…
Reducing errors in quantum gates is critical to the development of quantum computers. To do so, any distortions in the control signals should be identified, however, conventional tools are not always applicable when part of the system is…
We explore the multifractality of the steady state wave function in non-unitary random quantum dynamics in one dimension. We focus on two classes of random systems: the hybrid Clifford circuit model and the non-unitary free fermion…
We summarize the key ingredients required for universal topological quantum computation using Majorana zero modes in networks of topological superconductor nanowires. Particular emphasis is placed on the use of both sparse and dense logical…
Quantum probes that enable enhanced exploration and characterization of complex systems are central to modern science, spanning applications from biology to astrophysics and chemical design. In large many-body quantum systems, interactions…
Because Majorana zero modes store quantum information non-locally, they are protected from noise, and have been proposed as a building block for a quantum computer. We show how to use the same protection from noise to implement universal…
Tensor network methods leverage the limited entanglement of quantum states to efficiently simulate many-body systems. Alternatively, Clifford circuits provide a framework for handling highly entangled stabilizer states, which have low magic…
The Gottesman-Knill theorem asserts that a quantum circuit composed of Clifford gates can be efficiently simulated on a classical computer. Here we revisit this theorem and extend it to quantum circuits composed of Clifford and T gates,…
We investigate the stability of logical information in quantum stabilizer codes subject to coherent unitary errors. Beginning with a logical state, we apply a random unitary error channel and subsequently measure stabilizer checks,…
The remarkable properties and potential applications of Majorana fermions have led to considerable efforts in recent years to realize topological matters that host these excitations. For a number-conserving system, there have been a few…
We relax one of the requirements for topological quantum computation with Majorana fermions. Topological quantum computation was discussed so far as manipulation of the wave function within degenerate many body ground state. The simplest…
We give a pair of algorithms that efficiently learn a quantum state prepared by Clifford gates and $O(\log n)$ non-Clifford gates. Specifically, for an $n$-qubit state $|\psi\rangle$ prepared with at most $t$ non-Clifford gates, our…
We describe the structure of the $n$-qubit Clifford group $C_n$ via Cayley graphs, whose vertices represent group elements and edges represent generators. In order to obtain the action of Clifford gates on a given quantum state, we…
We present an algorithm for efficiently simulating a quantum circuit in the graph formalism. In the graph formalism, we represent states as a linear combination of graphs with Clifford operations on their vertices. We show how a…
We provide a conceptual framework for developing a scalable topological quantum computer. It relies on forming Majorana fermions using circular electronic gates in two-dimensional p-wave superconductors. The gates allow the precise control…
We study the implementation of fault-tolerant logical Clifford gates on stabilizer quantum error correcting codes based on their symmetries. Our approach is to map the stabilizer code to a binary linear code, compute its automorphism group,…
Stabilizer states are a prime resource for a number of applications in quantum information science, such as secret-sharing and measurement-based quantum computation. This motivates us to study the entanglement of noisy stabilizer states…
According to the Gottesman-Knill theorem, a class of quantum circuits, namely the so-called stabilizer circuits, can be simulated efficiently on a classical computer. We introduce a new algorithm for this task, which is based on the…