CQuIC Seminars
Quantum computing with black-box quantum subroutines
Presented by Kavan Modi, University of Oxford
In classical computation each subroutine can be treated as a black box - when we use pre-programmed operations we need not know their exact physical implementation. This modularity is highly desirable, as a complex problem can decompose into smaller problems with known solutions. Here we identify a general condition where quantum mechanically applying an unknown quantum process as a subroutine is impossible, which immediately forbids applying a black-box unitary conditioned on a quantum mechanical degree of freedom. This prevents several quantum protocols, including deterministic quantum computation with one qubit (DQC1), from operating on truly unknown inputs. We present a method to avoid this situation for certain computational problems. We apply this method to construct a modular version of Shor's factoring algorithm, reducing
its complexity.
3:30 pm, Thursday, December 12, 2013
PAIS-2540, PAIS
Individuals with disabilities who need an auxiliary aid or service to attend or participate in P&A events should contact the Physics Department (phone: 505-277-2616, email: physics@unm.edu) well in advance to ensure your needs are accomodated. Event handouts can be provided in alternative accessible formats upon request. Please contact the Physics front office if you need written information in an alternative format.
A schedule of talks within the Department of Physics and Astronomy is available on the P&A web site at http://physics.unm.edu/pandaweb/events/index.php