Write, autoreview, editor, reviewer
3,125
edits
Supplementary Information: Difference between revisions
Jump to navigation
Jump to search
no edit summary
No edit summary |
|||
| Line 1: | Line 1: | ||
==Glossary== | |||
== | |||
Quantum computation is marked by a set of unitary matrices (quantum gates) acting on qubit states followed by measurement. The most used representation is the circuit model of computation, comprising straight lines and boxes. The horizontal lines represent qubits and boxes represent single qubit unitary gates. A two qubit unitary gate links one qubit from another via vertical lines. Some useful notations are given below.<br/> | Quantum computation is marked by a set of unitary matrices (quantum gates) acting on qubit states followed by measurement. The most used representation is the circuit model of computation, comprising straight lines and boxes. The horizontal lines represent qubits and boxes represent single qubit unitary gates. A two qubit unitary gate links one qubit from another via vertical lines. Some useful notations are given below.<br/> | ||
===Quantum States=== | ===Quantum States=== | ||
| Line 55: | Line 54: | ||
===Density Matrices=== | ===Density Matrices=== | ||
===Fidelity=== | ===Fidelity=== | ||
===Superposition=== | ===Superposition=== | ||
===Discrete Variables and Continuous Variables=== | |||
===Entanglement=== | ===Entanglement=== | ||
===Measurement=== | ===Measurement=== | ||
== | |||
==Complexity== | ==[[Review Papers]]== | ||
==[[Complexity]]== | |||
==[[Adversarial Definitions]]== | |||
== | |||
*Quantum Honest But Curious | *Quantum Honest But Curious | ||
*Malicious | *Malicious | ||
| Line 73: | Line 68: | ||
*Learning With Errors | *Learning With Errors | ||
==Quantum Cryptography Techniques== | |||
==[[Quantum Cryptography Techniques]]== | |||
===Quantum One Time Pad=== | ===Quantum One Time Pad=== | ||