pith. sign in

arxiv: quant-ph/0701202 · v1 · submitted 2007-01-28 · 🪐 quant-ph

An explicit family of unitaries with exponentially minimal length Pauli geodesics

classification 🪐 quant-ph
keywords geodesicslengthminimalpaulitheyexponentiallyfamilygeodesic
0
0 comments X
read the original abstract

Recently, Nielsen et al have proposed a geometric approach to quantum computation. They've shown that the size of the minimum quantum circuits implementing a unitary U, up to polynomial factors, equals to the length of minimal geodesic from identity I through U. They've investigated a large class of solutions to the geodesic equation, called Pauli geodesics. They've raised a natural question whether we can explicitly construct a family of unitaries U that have exponentially long minimal length Pauli geodesics? We give a positive answer to this question.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.