15
GENERALIZED STABILIZERS Ted Yoder

Generalized Stabilizers

  • Upload
    rhona

  • View
    75

  • Download
    1

Embed Size (px)

DESCRIPTION

Generalized Stabilizers. Ted Yoder. 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. Schrödinger. - PowerPoint PPT Presentation

Citation preview

Page 1: Generalized Stabilizers

GENERALIZED STABILIZERSTed Yoder

Page 2: Generalized Stabilizers

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

Schrödinger

C

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

Page 4: Generalized Stabilizers

Heisenberg

C

~ What set of operators do we choose?

~ Require

Page 5: Generalized Stabilizers

Examples

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

~ And the state it stabilizes as

Page 6: Generalized Stabilizers

Destabilizer, Tableaus, Stabilizer Bases

~ We have . What is ?

~ Collect all in a group,

~ A tableau defines a stabilizer basis,

Page 7: Generalized Stabilizers

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

C1 C2

Page 9: Generalized Stabilizers

The Interaction Picture

Page 10: Generalized Stabilizers

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

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

References

Page 13: Generalized Stabilizers

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

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

Channels~ Define a Pauli channel as,

for Pauli operators

~ Define as a measure of its complexity.