Events Calendar
Quantum computing with black-box quantum subroutines
Thursday December 12, 2013
| 3:30 pm
Tweet |
Presenter: | Kavan Modi, University of Oxford |
|---|---|---|
| Series: | CQuIC Seminars | |
| Abstract: |
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. |
|
| Host: | Amir Kalev | |
| Location: | PAIS-2540, PAIS | |
If you need an auxiliary aid or service to attend any Department of Physics and Astronomy event, please contact the department (phone: 505 277-2616; email: