Physics – Quantum Physics
Scientific paper
2007-06-04
Physics
Quantum Physics
Ver.1- 58 pages (files: 1 .tex, 2 .sty, 14 .eps); Ver.2- 64 pages (files: 1 .tex, 2 .sty, 15 .eps, 2 .m, 1 .xxx) Corrected ser
Scientific paper
We say a unitary operator acting on a set of qubits has been compiled if it has been expressed as a SEO (sequence of elementary operations, like CNOTs and single-qubit operations). SEO's are often represented as quantum circuits. arXiv:quant-ph/0702144 by Farhi-Goldstone-Gutmann has inspired a recent flurry of papers, that propose quantum algorithms for evaluating NAND formulas via quantum walks over tree graphs. These algorithms use two types of unitary evolution: oracle and non-oracle. Non-oracle evolutions are independent of the NAND formula input, whereas oracle evolutions depend on this input. In this paper we compile (i.e., give explicit SEOs and their associated quantum circuits for) the oracle and non-oracle evolution operators used in some of these NAND formula evaluators. We consider here only the case of balanced binary NAND trees. Our compilation methods are based on the CSD (Cosine Sine Decomposition), a matrix decomposition from Linear Algebra. The CS decomposition has been used very successfully in the past to compile unstructured unitary matrices exactly.
No associations
LandOfFree
How to Compile Some NAND Formula Evaluators does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with How to Compile Some NAND Formula Evaluators, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and How to Compile Some NAND Formula Evaluators will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-726905