Abstracts
Poster Abstracts | Talk Abstracts
Quantum circuits synthesis using lattices over number fields
Presenting Author: Vadym Kliuchnikov, Microsoft Research
Contributing Author(s): Sebastian Schoennenbeck
We present new algorithms for multiple qubit exact synthesis and exact state preparation. The algorithms work for the unitaries related to Clifford+T, Real Clifford+Controlled-H, and other similar gate sets. The algorithms run-time is polynomial in the bit-size of the input when the number of qubits is fixed. We prove the correctness of the algorithms for two qubits. For three and more qubits our algorithms either solve the problem in polynomial time or report that the solution was not found. We conjecture that the second outcome never happens based on empirical results. Experiments show that our algorithms produce circuits with a smaller number of T-gates than the algorithms for state preparation and exact synthesis by Giles and Selinger [10.1103/PhysRevA.87.032332].
SQuInT Chief Organizer
Akimasa Miyake, Assistant Professor
amiyake@unm.edu
SQuInT Co-Organizer
Mark M. Wilde, Assistant Professor LSU
mwilde@phys.lsu.edu
SQuInT Administrator
Gloria Cordova
gjcordo1@unm.edu
505 277-1850
SQuInT Event Coordinator
Karen Jones, LSU
kjones@cct.lsu.edu
SQuInT Founder
Ivan Deutsch, Regents' Professor
ideutsch@unm.edu