Efficient Clifford+T approximation of single-qubit operators
暂无分享,去创建一个
[1] A. Kitaev. Quantum computations: algorithms and error correction , 1997 .
[2] Austin G. Fowler. Constructing arbitrary Steane code single logical qubit fault-tolerant gates , 2011, Quantum Inf. Comput..
[3] John Cremona,et al. ADVANCED TOPICS IN COMPUTATIONAL NUMBER THEORY (Graduate Texts in Mathematics 193) , 2001 .
[4] Krysta Marie Svore,et al. Distillation of Non-Stabilizer States for Universal Quantum Computation , 2013, TQC.
[5] Peter Selinger,et al. Remarks on Matsumoto and Amano's normal form for single-qubit Clifford+T operators , 2013, ArXiv.
[6] Dmitri Maslov,et al. Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits , 2012, Physical review letters.
[7] M. Rabin,et al. Randomized algorithms in number theory , 1985 .
[8] Nathan Wiebe,et al. Floating point representations in quantum circuit synthesis , 2013, 1305.5528.
[9] Kazuyuki Amano,et al. Representation of Quantum Circuits with Clifford and $\pi/8$ Gates , 2008, 0806.3834.
[10] Michael A. Nielsen,et al. The Solovay-Kitaev algorithm , 2006, Quantum Inf. Comput..
[11] Krysta Marie Svore,et al. Asymptotically Optimal Topological Quantum Compiling , 2013, Physical review letters.
[12] Dmitri Maslov,et al. Fast and efficient exact synthesis of single-qubit unitaries generated by clifford and T gates , 2012, Quantum Inf. Comput..
[13] M. Mosca,et al. A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits , 2012, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[14] Henri Cohen,et al. Advanced topics in computational number theory , 2000 .
[15] Mikhail N. Vyalyi,et al. Classical and Quantum Computation , 2002, Graduate studies in mathematics.
[16] Krysta Marie Svore,et al. A State Distillation Protocol to Implement Arbitrary Single-qubit Rotations , 2012, ArXiv.
[17] D. Leung,et al. Methodology for quantum logic gate construction , 2000, quant-ph/0002039.