A5040193392- Quantum Computing Algorithms and Architecture
- Quantum Information and Cryptography
- Quantum-Dot Cellular Automata
- Coding theory and cryptography
- Parallel Computing and Optimization Techniques
- Quantum Mechanics and Applications
- Cryptography and Data Security
- Numerical Methods and Algorithms
- graph theory and CDMA systems
- Computability, Logic, AI Algorithms
- Low-power high-performance VLSI design
- Cryptography and Residue Arithmetic
- Quantum and electron transport phenomena
- Cloud Computing and Resource Management
- Cryptographic Implementations and Security
- Advanced Chemical Physics Studies
- Cellular Automata and Applications
- Neural Networks and Reservoir Computing
- Quantum many-body systems
- Spectroscopy and Quantum Chemical Studies
- Optical Network Technologies
- Matrix Theory and Algorithms
- Finite Group Theory Research
- Chaos-based Image/Signal Encryption
- Computational Physics and Python Applications
Microsoft Research (United Kingdom)
2014-2024
Microsoft (United States)
2014-2023
Microsoft (Norway)
2021
University of Oxford
2020
École Polytechnique Fédérale de Lausanne
2020
Quantum Group (United States)
2019
Institute of Electrical and Electronics Engineers
2018
Regional Municipality of Niagara
2018
IEEE Computer Society
2018
ETH Zurich
2017
We present an algorithm for computing depth-optimal decompositions of logical operations, leveraging a meet-in-the-middle technique to provide significant speed-up over simple brute force algorithms. As illustration our method we implemented this and found factorizations the commonly used quantum operations into elementary gates in Clifford+T set. In particular, report decomposition Toffoli gate set Clifford T gates. Our achieves total T-depth 3, thereby providing 40% reduction previously...
We run a selection of algorithms on two state-of-the-art 5-qubit quantum computers that are based different technology platforms. One is publicly accessible superconducting transmon device with limited connectivity, and the other fully connected trapped-ion system. Even though systems have native interactions, both can be programmed in way blind to underlying hardware, thus allowing first comparison identical between physical systems. show circuits employ more connectivity clearly benefit...
The great promise of quantum computers comes with the dual challenges building them and finding their useful applications. We argue that these two should be considered together, by codesigning full-stack computer systems along applications in order to hasten development potential for scientific discovery. In this context, we identify community needs, opportunities, a sampling few use case studies, significant science over next 2–10 years. This document is written university, national...
Quantum computing exploits quantum phenomena such as superposition and entanglement to realize a form of parallelism that is not available traditional computing. It offers the potential significant computational speed-ups in chemistry, materials science, cryptography, machine learning. The dominant approach programming computers provide an existing high-level language with libraries allow for expression programs. This can permit computations are meaningless context; prohibits succinct...
Recently it was shown that the resources required to implement unitary operations on a quantum computer can be reduced by using probabilistic circuits called repeat-until-success (RUS) circuits. However, previously best-known algorithm synthesize RUS circuit for given target requires exponential classical runtime. We present probabilistically polynomial-time approximate any single-qubit precision $ϵ$ over $\text{Clifford}+T$ basis. Surprisingly, $T$ count of synthesized surpasses theoretical...
We determine the cost of performing Shor's algorithm for integer factorization on a ternary quantum computer, using two natural models universal fault-tolerant computing: (i) model based magic state distillation that assumes availability Clifford gates, projective measurements, classical control as its instrumentation set; (ii) metaplectic topological computer (MTQC). A choice to implement is translate entire arithmetic into form. However, it also possible emulate standard binary version by...
Abstract Elementary quantum mechanics proposes that a closed physical system consistently evolves in reversible manner. However, control and readout necessitate the coupling of to external environment, subjecting it relaxation decoherence. Consequently, system-environment interactions are indispensable for simulating physically significant theories. A broad spectrum systems condensed-matter high- energy physics, vibrational spectroscopy, circuit cavity QED necessitates incorporation bosonic...
We describe an implementation of Shor’s quantum algorithm to factor n-bit integers using only 2n+2 qubits. In contrast previous space-optimized implementations, ours features a purely Toffoli based modular multiplication circuit. The circuit depth and the overall gate count are in O(n 3 ) log n), respectively. thus achieve same space time costs as Takahashi et al. [1], while classical As consequence, our approach evades most cost overheads originating from rotation synthesis enables testing...
In this paper we improve the layered implementation of arbitrary stabilizer circuits introduced by Aaronson and Gottesman in Phys. Rev. A 70(052328), 2004: to obtain a general circuit, reduce their $11$-stage computation -H-C-P-C-P-C-H-P-C-P-C- over gate set consisting Hadamard, Controlled-NOT, Phase gates, into $7$-stage form -C-CZ-P-H-P-CZ-C-. We show arguments support using -CZ- stages -C- stages: not only use allows shorter expression, but are simpler appear be easier implement compared...
The quantum computation of electronic energies can break the curse dimensionality that plagues many-particle mechanics. It is for this reason a universal computer has potential to fundamentally change computational chemistry and materials science, areas in which strong electron correlations present severe hurdles traditional structure methods. Here we state-of-the-art analysis accurate energy measurements on catalysis, using improved algorithms with more than an order magnitude improvement...
Repeat-until-success (RUS) circuits can approximate a given single-qubit unitary with an expected number of $T$ gates about $\frac{1}{3}$ what is required by optimal, deterministic, ancilla-free decompositions over the Clifford + gate set. In this work, we introduce more general and conceptually simpler circuit decomposition method that allows for synthesis into protocols probabilistically implement quantum several universal sets including, but not restricted to, The protocol, which call...
We describe an implementation of Shor's quantum algorithm to factor n-bit integers using only 2n+2 qubits. In contrast previous space-optimized implementations, ours features a purely Toffoli ba...
We develop a method for approximate synthesis of single-qubit rotations the form e−if(φ1,...,φk)X that is based on Repeat-Until-Success (RUS) framework quantum circuit synthesis. demonstrate how smooth computable functions f can be synthesized from two basic primitives. This approach constitutes manifestly arithmetic differs greatly approaches commonly used in algorithms. The key advantage our it requires far fewer qubits than existing approaches: as case point, we show using few 3 ancilla...
The use of mid-circuit measurement and qubit reset within quantum programs has been introduced recently several applications demonstrated that perform conditional branching based on these measurements. In this work, we go a step further describe next-generation implementation classical computation embedded enables the real-time calculation adjustment program variables state measured qubits. A full-featured Quantum Intermediate Representation (QIR) model is used to circuit including its...
We introduce a new quantum adversary method to prove lower bounds on the query complexity of state generation problem. This problem encompasses both, computation partial or total functions and preparation target states. There has been hope for quite some time that might be route tackle GRAPH-ISOMORPHISM show related INDEX-ERASURE our leads bound square root N which matches an upper obtained via reduction search elements. closes open first raised by Shi [FOCS'02]. Our approach is based two...
Rejection sampling is a well-known method to sample from target distribution, given the ability distribution. The has been first formalized by von Neumann [1951] and many applications in classical computing. We define quantum analogue of rejection sampling: black box producing coherent superposition (possibly unknown) states with some amplitudes, problem prepare same states, albeit different amplitudes. main result this article tight characterization query complexity state generation...
Recent developments in quantum hardware indicate that systems featuring more than 50 physical qubits are within reach. At this scale, classical simulation will no longer be feasible and there is a possibility such devices may outperform even supercomputers at certain tasks. With the rapid growth of qubit numbers coherence times comes increasingly difficult challenge program compilation. This entails translation high-level description algorithm to hardware-specific low-level operations which...