2019 · 43 citations · 49 references
Natural SciencesMathematicsPhysicsAlgebraQuantum ComputingQuantum MechanicsAbstract AlgebraAlgebraic GeometryQuantum ComputationQuantum Information TheoryCorrectness ProofsQuantum Error-correcting CodesUnitary OperatorsUnitary Representations
We present an infinite number of construction schemes involving unitary error bases, Hadamard matrices, quantum Latin squares and controlled families, many of which have not previously been described. Our results rely on biunitary connections, algebraic objects which play a central role in the theory of planar algebras. They have an attractive graphical calculus which allows simple correctness proofs for the constructions we present. We apply these techniques to construct a unitary error basis that cannot be built using any previously known method.
49
Communication Theory of Secrecy Systems*
Claude E. Shannon · Bell System Technical Journal · 1949 · 9.3K citations
Fault-tolerant quantum computation
Peter W. Shor · 2002 · 915 citations
Computing, Computer Science, Physics +17
Thomas Durt, Berthold‐Georg Englert, Ingemar Bengtsson et al. · International Journal of Quantum Information · 2010 · 739 citations · Full text
The geometry of tensor calculus, I
André Joyal, Ross Street · Advances in Mathematics · 1991 · 671 citations