A slightly smaller surface code S gate
英文摘要：
We cut the volume of surface code S gates by 25% by omitting a Hadamard gate.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
相关论文
Constructing Smaller Pauli Twirling Sets for Arbitrary Error Channels
Twirling is a technique widely used for converting arbitrary noise channels into Pauli channels in error threshold estimations of quantum error correction codes. It is vitally useful both in real experiments and in classical quantum simulations. Minimising the size of the twirling gate set increases the efficiency of simulations and in experiments it might reduce both the number of runs required and the circuit depth (and hence the error burden). Conventional twirling uses the full set of Pauli gates as the set of twirling gates. This article provides a theoretical background for Pauli twirlin…
quant-ph
Smaller Circuits for Arbitrary n-qubit Diagonal Computations
A unitary operator U=\sum u_{j,k} |k><j| is called diagonal when u_{j,k}=0 unless j=k. The definition extends to quantum computations, where j and k vary over the 2^n binary expressions for integers 0,1 ..., 2^n-1, given n qubits. Such operators do not affect outcomes of the projective measurement {<j| ; 0 <= j <= 2^n-1} but rather create arbitrary relative phases among the computational basis states {|j> ; 0 <= j <= 2^n-1}. These relative phases are often required in applications. Constructing quantum circuits for diagonal computations using standard techniques requires either O(n^2 2^n) cont…
quant-ph
Fault-tolerant gates on hypergraph product codes
Hypergraph product codes are a class of quantum low density parity check (LDPC) codes discovered by Tillich and Zémor. These codes have a constant encoding rate and were recently shown to have a constant fault-tolerant error threshold. With these features, they asymptotically offer a smaller overhead compared to topological codes. However, existing techniques to perform logical gates in hypergraph product codes require many separate code blocks, so only becomes effective with a very large number of logical qubits. Here, we demonstrate how to perform Clifford gates on this class of codes using …
quant-ph
Threshold Estimate for Fault Tolerant Quantum Computation
I make a rough estimate of the accuracy threshold for fault tolerant quantum computing with concatenated codes. First I consider only gate errors and use the depolarizing channel error model. I will follow P.Shor (quant-ph/9505011) for fault tolerant error correction (FTEC) and the fault tolerant implementation of elementary operations on states encoded by the 7-qubit code. A simple computer simulation suggests a threshold for gate errors of the order ε\approx 10^{-3} or better. I also give a simple argument that the threshold for memory errors is about 10 times smaller, thus ε\approx 10^{-4}.
quant-ph
