Sparse Quantum Codes From Quantum Circuits

被引:25
作者
Bacon, Dave [1 ,2 ]
Flammia, Steven T. [1 ,3 ]
Harrow, Aram W. [1 ,4 ]
Shi, Jonathan [1 ,5 ]
机构
[1] Univ Washington, Dept Comp Sci & Engn, Seattle, WA 98195 USA
[2] Google Inc, Mountain View, CA 94043 USA
[3] Univ Sydney, Sch Phys, Ctr Engn Quantum Syst, Sydney, NSW 2006, Australia
[4] MIT, Ctr Theoret Phys, Cambridge, MA 02139 USA
[5] Cornell Univ, Dept Comp Sci, Ithaca, NY 14853 USA
基金
美国国家科学基金会; 澳大利亚研究理事会;
关键词
Quantum computing; error-correcting codes; ERROR-CORRECTING CODES; SURFACE CODES; GRAPHS; COMPUTATION;
D O I
10.1109/TIT.2017.2663199
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We describe a general method for turning quantum circuits into sparse quantum subsystem codes. The idea is to turn each circuit element into a set of low-weight gauge generators that enforce the input-output relations of that circuit element. Using this prescription, we can map an arbitrary stabilizer code into a new subsystem code with the same distance and number of encoded qubits but where all the generators have constant weight, at the cost of adding some ancilla qubits. With an additional overhead of ancilla qubits, the new code can also be made spatially local. Applying our construction to certain concatenated stabilizer codes yields families of subsystem codes with constant-weight generators and with minimum distance d = n(1-is an element of), where is an element of = O(1/ root log n). For spatially local codes in D dimensions, we nearly saturate a bound due to Bravyi and Terhal and achieve d = n(1-is an element of-1/D). Previously the best code distance achievable with constant-weight generators in any dimension, due to Freedman, Meyer, and Luo, was O(root n log n) for a stabilizer code.
引用
收藏
页码:2464 / 2479
页数:16
相关论文
共 56 条
[1]   Subsystem fault tolerance with the Bacon-Shor code [J].
Aliferis, Panos ;
Cross, Andrew W. .
PHYSICAL REVIEW LETTERS, 2007, 98 (22)
[2]  
[Anonymous], THESIS
[3]  
Ashikhmin A, 2001, PHYS REV A, V63, DOI 10.1103/PhysRevA.63.032311
[4]   Quantum error detection II: Bounds [J].
Ashikhmin, AE ;
Barg, AM ;
Knill, E ;
Litsyn, SN .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (03) :789-800
[5]   Operator quantum error-correcting subsystems for self-correcting quantum memories [J].
Bacon, D .
PHYSICAL REVIEW A, 2006, 73 (01)
[6]   THE ISOPERIMETRIC NUMBER OF RANDOM REGULAR GRAPHS [J].
BOLLOBAS, B .
EUROPEAN JOURNAL OF COMBINATORICS, 1988, 9 (03) :241-244
[7]   Topological subsystem codes [J].
Bombin, H. .
PHYSICAL REVIEW A, 2010, 81 (03)
[9]   Homological Product Codes [J].
Bravyi, Sergey ;
Hastings, Matthew B. .
STOC'14: PROCEEDINGS OF THE 46TH ANNUAL 2014 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2014, :273-282
[10]   Quantum Self-Correction in the 3D Cubic Code Model [J].
Bravyi, Sergey ;
Haah, Jeongwan .
PHYSICAL REVIEW LETTERS, 2013, 111 (20)