The Quantum Architectures and Computation group is a team of leading quantum computer scientists and engineers dedicated to developing real-world quantum algorithms, understanding their implications, and designing a comprehensive software architecture for programming such algorithms on a scalable, fault-tolerant, quantum computer. Our mission is to advance our understanding of quantum computing and its applications and implementation.

The QuArC group collaborates closely with Microsoft Research Station Q in Santa Barbara and several universities worldwide including TU Delft (Leo Kouwenhoven), Niels Bohr Institute (Charlie Marcus), University of Illinois, Urbana-Champaign (Dale van Harlingen), and Harvard University (Amir Yacoby).

- Adam Paetznick and Krysta M. Svore, Repeat-Until-Success: Non-deterministic decomposition of single-qubit unitaries, in
*Quantum Information and Computation*, vol. 14, no. 15&16, pp. 1277-1301, Rinton Press, 1 November 2014 - Alex Bocharov, Martin Roetteler, and Krysta M. Svore, Efficient Synthesis of Probabilistic Quantum Circuits with Fallback, September 2014
- Nathan Wiebe, Christopher Granade, and David Cory, Quantum Bootstrapping via Compressed Quantum Hamiltonian Learning, in
*arXiv:1409.1524*, September 2014 - M. Rötteler and R. Steinwandt, A note on quantum related-key attacks, in
*Information Processing Letters*, vol. 115, pp. 40–44, 26 August 2014 - M. B. Hastings and A. Geller, Reduced Space-Time and Time Costs Using Dislocation Codes and Arbitrary Ancillas, in
*arXiv*, -1, 14 August 2014 - M. Rötteler and R. Steinwandt, A quantum circuit to find discrete logarithms on ordinary binary elliptic curves in depth O(log^2 n), in
*Quant. Inform. & Comp.*, vol. 14, no. 9&10, pp. 888-900, Rinton Press, July 2014 - Davd Poulin, M.B. Hastings, Dave Wecker, Nathan Wiebe, Andrew C. Doherty, and Matthias Troyer, The Trotter Step Size Required for Accurate Quantum Simulation of Quantum Chemistry, in
*tbd*, arXiv, 19 June 2014 - Nathan Wiebe and Martin Roetteler, Quantum arithmetic and numerical analysis using Repeat-Until-Success circuits, no. MSR-TR-2014-103, 19 June 2014
- N. de Beaudrap and M. Rötteler, Quantum linear network coding as one-way quantum computation, in
*Proceedings TQC'14, to appear*, LIPIcs Leibniz International Proceedings in Informatics, May 2014 - Nathan Wiebe, Christopher Granade, Christopher Ferrie, and DG Cory, Hamiltonian learning and certification using quantum resources, in
*Phys. Rev. Lett. 112, 190501*, American Physical Society, May 2014 - Alex Bocharov, Martin Roetteler, and Krysta M. Svore, Efficient Synthesis of Universal Repeat-Until-Success Circuits, 23 April 2014
- Vadym Kliuchnikov, Alex Bocharov, and Krysta M. Svore, Asymptotically Optimal Topological Quantum Compiling, in
*Physical Review Letters*, vol. 112, no. 140504, American Physical Society, 9 April 2014 - Yu Tomita and Krysta M. Svore, Low-distance Surface Codes under Realistic Quantum Noise, April 2014
- Nathan Wiebe, Christopher Granade, Christopher Ferrie, and David G. Cory, Quantum Hamiltonian Learning Using Imperfect Quantum Resources, in
*Physical Review A 89, 042314*, April 2014 - Andreas Blass and Yuri Gurevich, Ancilla approximable quantum state transformations, in
*arXiv:1403.7815*, 30 March 2014 - Dave Wecker and Krysta M. Svore, LIQUi|>: A Software Design Architecture and Domain-Specific Language for Quantum Computing, February 2014
- Troels F. Ronnow, Zhihui Wang, Joshua Job, Sergio Boixo, Sergei V. Isakov, David Wecker, John M. Martinis, Daniel A. Lidar, and Matthias Troyer, Defining and detecting quantum speedup, 13 January 2014
- S. Bravyi and M. B. Hastings, Homological Product Codes , in
*ACM STOC*, 2014 - M. B. Hastings, D. Wecker, B. Bauer, and M. Troyer, Improving Quantum Algorithms for Quantum Chemistry, in
*QIC, in press.*, 2014 - M. B. Hastings, G. H. Watson, and R. G. Melko, Self-Correcting Quantum Memories Beyond the Percolation Threshold, in
*Physical Review Letters*, 2014 - Nathan Wiebe, Ashish Kapoor, and Krysta M. Svore, Quantum Nearest-neighbor Algorithms for Machine Learning, in
*To appear in Quantum Information and Computation*, Rinton Press, January 2014 - Nathan Wiebe, Using Quantum Computers to Learn Physics, in
*Bulletin of EATCS 1 (112)*, January 2014 - Dave Wecker, Bela Bauer, Bryan K. Clark, Matthew B. Hastings, and Matthias Troyer, Can quantum chemistry be performed on a small quantum computer?, 5 December 2013
- Guillaume Duclos-Cianci and Krysta M. Svore, A State Distillation Protocol to Implement Arbitrary Single-qubit Rotations, in
*Physical Review A*, vol. 88, no. 042325, American Physical Society, 17 October 2013 - G. Chiribella, G. M. D'Ariano, and M. Rötteler, Identification of a reversible quantum gate: assessing the resources, in
*New Journal of Physics*, vol. 15, pp. 103019, IOP, October 2013 - Alex Bocharov, Yuri Gurevich, and Krysta M. Svore, Efficient Decomposition of Single-Qubit Gates into V Basis Circuits , in
*Physical Review A*, vol. 88, no. 012313, American Physical Society, 12 July 2013 - Paul Pham and Krysta M. Svore, A 2D Nearest-Neighbor Quantum Architecture for Factoring, in
*Quantum Information and Computation*, vol. 13, no. 11&12, pp. 0937-0962, Rinton Press, July 2013 - Alex Bocharov and Krysta M. Svore, From Reversible Logic Gates to Universal Quantum Bases, in
*Logic in Computer Science Column*, June 2013 - M. Amy, D. Maslov, M. Mosca, and M. Rötteler, A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits, in
*IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems*, vol. 32, no. 6, pp. 818–830, IEEE, June 2013 - Lei Wang, Troels F. Ronnow, Sergio Boixo, Sergei V. Isakov, Zhihui Wang, David Wecker, Daniel A. Lidar, John M. Martinis, and Matthias Troyer, Comment on: "Classical signature of quantum annealing" , 24 May 2013
- Sergio Boixo, Troels F. Ronnow, Sergei V. Isakov, Zhihui Wang, David Wecker, Daniel A. Lidar, John M. Martinis, and Matthias Troyer, Quantum annealing with more than one hundred qubits, April 2013
- Krysta M. Svore, Matthew B. Hastings, and Michael Freedman, Faster Phase Estimation, in
*Quantum Information and Computation*, vol. 14, no. 3&4, pp. 306-328, Rinton Press, April 2013 - M. B. Hastings, Classifying Quantum Phases With The Torus Trick , in
*Physical Review B*, 2013 - A. M. Childs, R. Kothari, M. Ozols, and M. Rötteler, Easy and hard functions for the Boolean hidden shift problem, in
*Proceedings of the 8th Conference on Theory of Quantum Computation, Communication, and Cryptography (TQC'13), Guelph, ON, Canada*, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2013 - M. Ozols, M. Rötteler, and J. Roland, Quantum rejection sampling, in
*ACM Transactions on Computation Theory*, vol. 5, no. 3, pp. 11, 2013 - M. B. Hastings, Decoding in Hyperbolic Spaces: LDPC Codes With Linear Rate and Efficient Error Correction , in
*QIC, in press*, 2013 - B. Amento, M. Rötteler, and R. Steinwandt, Quantum binary field inversion: improved circuit depth via choice of basis representation, in
*Quant. Inform. & Comp.*, vol. 13, no. 1&2, pp. 116–134, 2013 - B. Amento, M. Rötteler, and R. Steinwandt, Efficient quantum circuits for binary elliptic curve arithmetic: reducing T-gate complexity, in
*Quant. Inform. & Comp.*, vol. 13, no. 7&8, pp. 631–644, 2013 - M. B. Hastings and S. Michalakis, Quantization of Hall Conductance For Interacting Electrons on a Torus , in
*Communications in Mathematical Physics, submitted*, 2013 - M. Grassl and M. Rötteler, Leveraging automorphisms of quantum codes for fault-tolerant quantum computation, in
*Proceedings of the 2013 IEEE International Symposium on Information Theory (ISIT'13), Istanbul, Turkey*, 2013 - Alex Bocharov and Krysta M. Svore, Resource-Optimal Single-Qubit Quantum Circuits, in
*Physical Review Letters*, vol. 109, no. 190501, pp. 5, American Physical Society, 8 November 2012 - Andrew M. Childs and Nathan Wiebe, Hamiltonian Simulation Using Linear Combinations of Unitary Operations, in
*Quantum Information and Computation*, Rinton Press, 2012 - A. Ambainis, L. Magnin, M. Rötteler, and J. Roland, Symmetry-assisted adversaries for quantum state generation, in
*Proceedings of the 26th Annual IEEE Conference on Computational Complexity (CCC'11)*, 2011 - M. Rötteler, Quantum algorithms for highly non-linear Boolean functions, in
*Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'10)*, 2010 - S. Hallgren, C. Moore, M. Rötteler, A. Russell, and P. Sen, Limitations of quantum coset states for graph isomorphism, in
*Journal of the ACM*, vol. 57, no. 6, pp. 34:1–34:33, 2010 - J. Radhakrishnan, M. Rötteler, and P. Sen, Random measurement bases, quantum state distinction and applications to the hidden subgroup problem, in
*Algorithmica*, vol. 55, no. 3, pp. 490–516, 2009 - Krysta M. Svore, Andrew W. Cross, Isaac L. Chuang, and Alfred V. Aho, A flow-map model for analyzing pseudothresholds in fault-tolerant quantum computing, in
*Quantum Information and Computation*, vol. 6, no. 3, pp. 193-212, Rinton Press, December 2006 - Tom Draper, Samuel Kutin, Eric Rains, and Krysta M. Svore, A Logarithmic-depth Quantum Carry-Lookahead Adder, in
*Quantum Information and Computation*, vol. 6, no. 4-5, pp. 351-369, Rinton Press, January 2006 - Krysta M. Svore, Alfred V. Aho, Andrew W. Cross, Isaac Chuang, and Igor L. Markov, A Layered Software Architecture for Quantum Computing Design Tools, in
*IEEE Computer*, vol. 06, no. 0018-9162, pp. 58-67, IEEE Computer Society, January 2006 - Krysta M. Svore, Barbara M. Terhal, and David P. DiVincenzo, Local fault-tolerant quantum computation, in
*Physical Review A*, vol. 72, no. 022317, American Physical Society, January 2005 - Krysta M. Svore, Andrew Cross, Alfred V. Aho, Isaac Chuang, and Igor Markov, Toward a Software Architecture for Quantum Computing Design Tools, in
*Proceedings of Quantum Programming Languages (QPL)*, July 2004 - Krysta M. Svore and Alfred V. Aho, The Design and Optimization of Quantum Circuits using the Palindrome Transform, in
*Proceedings of the ERATO Conference on Quantum Information Sciences (EQIS)*, September 2003

- Machine Learning in the Cloud Made Easier for Researchers—Azure ML Grants Available
- A Year of Research in the Cloud
- Microsoft’s Quantum Mechanics
- From Quantum Computing to Show Dogs, Faculty Summit Informed and Inspired
- Quantum Computing and the Value of Storytelling in Science
- Station Q: the Quest for a Quantum Future
- Microsoft Makes Bet Quantum Computing Is Next Breakthrough

# Applications

*We're looking for exceptional people!* The QuArC group is looking for exceptional candidates for post-doc positions. We're also looking for talented graduate students for 12-week internships. Interested candidates should send their CV to ksvore AT microsoft DOT com.

Application deadline for Spring/Summer 2015: Jan. 30, 2015.

For more details on Microsoft Research Internships click here.

### Upcoming Events:

### Recent Events:

- Microsoft Faculty Summit 2014; July 14-15, 2014, Redmond, WA; Featured speakers include David Reilly, Rob Schoelkopf, Dave Wecker.
- Aspen Winter Conference on Advances in Quantum Algorithms and Computation; March 9-14, 2014, Aspen, CO
- Microsoft Faculty Summit 2013; July 15-16, 2013, Redmond, WA; Featured speakers included Scott Aaronson, Charlie Marcus, and Matthias Troyer

### Current Interns:

- Jon Welch (Harvard)
- Ryan Babbush (Harvard)
- Tomas Jochym O'Connor (U. Waterloo)
- Alex Parent (U. Waterloo)
- Raghu Mahajan (Stanford)

### Past Interns:

- Rebecca Chen (Harvard; 2013)
- Guillaume Duclos-Cianci (U. Sherbrooke; 2012)
- Arvin Faruque (UCSB; 2012)
- Vadym Kliuchnikov (U. Waterloo; 2013)
- Adam Paetznick (U. Waterloo; 2013)
- Paul Pham (UW; 2011)
- Andrew das Sarma (Harvard; 2012)
- Lukas Svec (UW; 2012)
- Yu Tomita (Georgia Tech; 2013)