极小普适双量子比特量子电路
量子物理
2013-05-29 v3
摘要
我们给出可达全局相位任意双量子比特酉算符的量子电路。对于若干量子门库，我们证明了在最坏和平均情况下门计数均为最优。我们的上下界优于先前发表的结果。未使用临时存储，因其在物理实现中往往代价高昂。对于每个门库，最佳门计数可由单一普适电路实现。为计算普适电路中的门参数，我们仅使用闭式代数表达式，特别地不依赖矩阵指数。我们的算法已用C++编码。
引用
@article{arxiv.quant-ph/0308033,
title = {Minimal Universal Two-qubit Quantum Circuits},
author = {Vivek V. Shende and Igor L. Markov and Stephen S. Bullock},
journal= {arXiv preprint arXiv:quant-ph/0308033},
year = {2013}
}
备注
8 pages, 2 tables and 4 figures. v3 adds a discussion of asymetry between Rx, Ry and Rz gates and describes a subtle circuit design problem arising when Ry gates are not available. v2 sharpens one of the loose bounds in v1. Proof techniques in v2 are noticeably revamped: they now rely less on circuit identities and more on directly-computed invariants of two-qubit operators. This makes proofs more constructive and easier to interpret as algorithms