Sparse Quantum Codes from Quantum Circuits

Add to your list(s) Download to your calendar using vCal

• Aram Harrow (MIT)
• Thursday 23 October 2014, 14:15-15:15
• MR3, Centre for Mathematical Sciences, Wilberforce Road, Cambridge.

If you have a question about this talk, please contact William Matthews.

We describe a general method for turning quantum circuits into sparse quantum subsystem codes. 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 – ε} for any ε>0. For spatially local codes in D dimensions we nearly saturate a bound due to Bravyi and Terhal and achieve d = n^(1-ε-1/D). Previously the best code distance achievable with constant-weight generators in any dimension, due to Freedman, Meyer and Luo, was O(sqrt(n log(n))) for a stabilizer code.

Joint work with Dave Bacon, Steve Flammia and Jonathan Shi

This talk is part of the CQIF Seminar series.

This talk is included in these lists:

• All CMS events
• CMS Events
• CQIF Seminar
• DAMTP info aggregator
• Hanchen DaDaDash
• Interested Talks
• MR3, Centre for Mathematical Sciences, Wilberforce Road, Cambridge
• bld31

Note that ex-directory lists are not shown.