Toward a Quantum Revolution for Computing – American Philosophical Society
Krysta Svore speaking at the American Philosophical Society Autumn Meeting on November 11, 2016.
Krysta Svore speaking at the American Philosophical Society Autumn Meeting on November 11, 2016.
Techniques to efficiently compile high-level quantum algorithms into lower-level fault-tolerant cicuits are crucial for the implementation of a scalable quantum computer. Several universal gate sets can be used for compilation, including Clifford+T, Clifford+K, and Clifford+V.
Quantum computing promises to revolutionize how we compute and change the way we use technology in our daily lives. Dr. Krysta Svore, Senior Researcher at Microsoft Research in Redmond, Washington, reveals some of the mysteries…
Microsoft Ignite Session: THR2273 Microsoft Quantum Compute, thought leader and engineer Krysta Svore, walks through her team’s critical breakthroughs and their potential for solving the worlds biggest problems, with computationally-intensive tasks now resolved at record…
Since 1981 when Richard Feynman proposed a device called a “quantum computer” to take advantage of the laws of quantum physics to achieve computational speed-ups over classical methods, quantum algorithms have been developed that offer…
The Picnic and Fish signature schemes are digital signature schemes secure against attacks by quantum computers. This is a reference implementation of these schemes, associated with the paper Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives.
09/20/2017: David Aasen, Caltech Fermion condensation and superconducting string-nets 10/17/2017: Guanyu Zhu, JQI Single-shot modular transformation: implementing transversal logical gates and diagnosing fractional statistics 10/18/2017: Adrian Po, Harvard Dynamical chiral phases and anomalies 10/24/2017: Terry…