Top Banner
GENERALIZED STABILIZERS Ted Yoder
15

GENERALIZED STABILIZERS Ted Yoder. Quantum/Classical Boundary How do we study the power of quantum computers compared to classical ones? Compelling problems.

Dec 14, 2015

Download

Documents

Hana Miller
Welcome message from author
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Page 1: GENERALIZED STABILIZERS Ted Yoder. Quantum/Classical Boundary How do we study the power of quantum computers compared to classical ones? Compelling problems.

GENERALIZED STABILIZERSTed Yoder

Page 2: GENERALIZED STABILIZERS Ted Yoder. Quantum/Classical Boundary How do we study the power of quantum computers compared to classical ones? Compelling problems.

Quantum/Classical Boundary• How do we study the power of quantum computers

compared to classical ones?

• Compelling problems• Shor’s factoring• Grover’s search

• Oracle separations• Quantum resources

• Entanglement• Discord

• Classical simulation

Page 3: GENERALIZED STABILIZERS Ted Yoder. Quantum/Classical Boundary How do we study the power of quantum computers compared to classical ones? Compelling problems.

Schrödinger

C

~ What is the probability of measuring the first qubit to be 0?

Page 4: GENERALIZED STABILIZERS Ted Yoder. Quantum/Classical Boundary How do we study the power of quantum computers compared to classical ones? Compelling problems.

Heisenberg

C

~ What set of operators do we choose?

~ Require

Page 5: GENERALIZED STABILIZERS Ted Yoder. Quantum/Classical Boundary How do we study the power of quantum computers compared to classical ones? Compelling problems.

Examples

~ By analogy to the first, we can write any stabilizer as

~ And the state it stabilizes as

Page 6: GENERALIZED STABILIZERS Ted Yoder. Quantum/Classical Boundary How do we study the power of quantum computers compared to classical ones? Compelling problems.

Destabilizer, Tableaus, Stabilizer Bases

~ We have . What is ?

~ Collect all in a group,

~ A tableau defines a stabilizer basis,

Page 7: GENERALIZED STABILIZERS Ted Yoder. Quantum/Classical Boundary How do we study the power of quantum computers compared to classical ones? Compelling problems.

Generalized Stabilizer

~ Take any quantum state and write it in a stabilizer basis,

~ Then all the information about can be written as the pair

~ Any state can be represented

~ Any operation can be simulated- Unitary gates- Measurements- Channels

Page 8: GENERALIZED STABILIZERS Ted Yoder. Quantum/Classical Boundary How do we study the power of quantum computers compared to classical ones? Compelling problems.

C1 C2

Page 9: GENERALIZED STABILIZERS Ted Yoder. Quantum/Classical Boundary How do we study the power of quantum computers compared to classical ones? Compelling problems.

The Interaction Picture

Page 10: GENERALIZED STABILIZERS Ted Yoder. Quantum/Classical Boundary How do we study the power of quantum computers compared to classical ones? Compelling problems.

Update Efficiencies~ For updates can be done with the following efficiency:

~ Gottesman-Knill 1997

On stabilizer states, we have the update efficiencies

- Clifford gates:

- Pauli measurements:

~ Note the correspondence when .

Page 11: GENERALIZED STABILIZERS Ted Yoder. Quantum/Classical Boundary How do we study the power of quantum computers compared to classical ones? Compelling problems.

Conclusion• New (universal) state representation

• Combination of stabilizer and density matrix representation• Features dynamic basis that allows efficient simulation of Clifford gates

• The interaction picture for quantum circuit simulation

• Leads to a sufficient condition on states easily simulatable through any stabilizer circuit

Page 12: GENERALIZED STABILIZERS Ted Yoder. Quantum/Classical Boundary How do we study the power of quantum computers compared to classical ones? Compelling problems.

References

Page 13: GENERALIZED STABILIZERS Ted Yoder. Quantum/Classical Boundary How do we study the power of quantum computers compared to classical ones? Compelling problems.

Stabilizer Circuits

~ Clifford gates can be simulated in time

~ Recall that stabilizer circuits are those made fromand a final measurement of the operator .

~ What set of states can be efficiently simulated by a classical computer through any stabilizer circuit?

Page 14: GENERALIZED STABILIZERS Ted Yoder. Quantum/Classical Boundary How do we study the power of quantum computers compared to classical ones? Compelling problems.

Measurements

~ We’ll measure the complexity of by

~ The complexity of a state can be defined as

~ Simulating measurement of takes time

~ What set of states can be efficiently simulated by a classical computer through any stabilizer circuit?

is sufficient.

Page 15: GENERALIZED STABILIZERS Ted Yoder. Quantum/Classical Boundary How do we study the power of quantum computers compared to classical ones? Compelling problems.

Channels~ Define a Pauli channel as,

for Pauli operators

~ Define as a measure of its complexity.