8
collaborators
1999–2015
years active
Contributions
QIP QCrypt TQC talk poster presenter award · △program ◇steering ○organizing · filled = chair
6 Talks
| Title | Conference | Type | Co-authors |
|---|---|---|---|
| A quantum algorithm for computing the unit group of an arbitrary degree number field | QIP 2015 | plenary | Kirsten Eisentraeger, Sean Hallgren, Fang Song |
|
“An area law and sub-exponential algorithm for 1D systems.” ↗
|
QIP 2013 | invited | Zeph Landau, Umesh Vazirani, Itai Arad |
| 2-local Hamiltonian is QMA-complete | QIP 2005 | invited | Julia Kempe, Oded Regev |
| Quantum coin-flipping | QIP 2003 | invited ▸ presenter | — |
| Anyons and protected qubits in a spin model on the honeycomb lattice | QIP 2002 | invited | — |
| Quantum NP | QIP 1999 | invited | — |
A computational problem is said to be in BQNP if it can be defined in terms of a quantum witness verifiable on a quantum computer in polynomial time. (The abbreviation stands for "bounded error probability, quantum nondeterministic polinomial"). The following problem is shown to be BQNP complete: decide whether a "local Hamiltonian" (a sum of several Hermitian operators, each involving a constant number of qubits) has an eigenvalue smaller then a, or all the eigenvalues are larger than b, where 1/(b-a) is polynomial. |
|||
Collaborators
| Co-author | Joint talks |
|---|---|
| Fang Song | 1 |
| Itai Arad | 1 |
| Julia Kempe | 1 |
| Kirsten Eisentraeger | 1 |
| Oded Regev | 1 |
| Sean Hallgren | 1 |
| Umesh Vazirani | 1 |
| Zeph Landau | 1 |