Name
Abstract | ||
|---|---|---|
We prove that a quantum circuit together with measurement apparatuses and EPR sources can be self-tested, i.e. fully verified without any reference to some trusted set of quantum devices. To achieve our goal we define the notions of simulation and equivalence. Using these two concepts, we construct sets of simulation conditions which imply that the physical device of interest is equivalent to the one it is supposed to implement. Another benefit of our formalism is that our statements can be proved to be robust. Finally, we design a test for quantum circuits whose complexity is polynomial in the number of gates and qubits, and the required precision. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/11786986_8 | ICALP |
Keywords | Field | DocType |
physical device,quantum device,quantum circuit,measurement apparatus,epr source,required precision,simulation condition,satisfiability,equivalence relation,quantum physics | Quantum circuit,Topology,Discrete mathematics,Computer science,Quantum process,Algorithm,Quantum computer,Quantum algorithm,Quantum information,Quantum capacity,Quantum error correction,Quantum network | Conference |
Volume | ISSN | ISBN |
4051 | 0302-9743 | 3-540-35904-4 |
Citations | PageRank | References |
12 | 0.98 | 7 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Frédéric Magniez | 1 | 570 | 44.33 |
| Dominic Mayers | 2 | 390 | 48.33 |
| Michele Mosca | 3 | 119 | 14.56 |
| Harold Ollivier | 4 | 55 | 3.37 |