Diagonal unitary operators are commonly found in many quantum algorithms. They find application as analytical potential operators for quantum simulation, as well as for complex oracles used in quantum searches. However, in order to implement a quantum algorithm on a given quantum device, each operator must be decomposed into a sequence of fault-tolerant, device-level instructions. In general, to implement an $n$-qubit diagonal unitary {\em exactly} on a quantum computer generally requires $2^{n+1}-3$ one- and two-qubit gates. However, for most practical implementations of diagonal unitaries, some degree of approximation will be necessary if the circuit is to be efficient. In this thesis we develop two complementary methods for the approximate synthesis of quantum circuits for diagonal unitaries. We show how to apply these techniques to real-space quantum simulation and show how efficient high fidelity quantum simulations can be implemented with low-depth quantum circuits. / Engineering and Applied Sciences - Applied Physics
| Identifer | oai:union.ndltd.org:harvard.edu/oai:dash.harvard.edu:1/23845468 |
| Date | 04 December 2015 |
| Creators | Welch, Jonathan M. |
| Contributors | Aspuru-Guzik, Alan, Herschbach, Dudley, Vadhan, Salil, Valiant, Leslie |
| Publisher | Harvard University |
| Source Sets | Harvard University |
| Language | English |
| Detected Language | English |
| Type | Thesis or Dissertation, text |
| Format | application/pdf |
| Rights | open |
Page generated in 0.017 seconds