1k citations · 1.7k across the 17 of their papers we have counts for
18 papers
Roadmap to fault tolerant quantum computation using topological qubit arrays
David Aasen, Morteza Aghaee, Zulfi Alam +179
We describe a concrete device roadmap towards a fault-tolerant quantum computing architecture based on noise-resilient, topologically protected Majorana-based qubits. Our roadmap e…
Image Classification by Throwing Quantum Kitchen Sinks at Tensor Networks
Nathan X. Kodama, Alex Bocharov, Marcus P. da Silva
Several variational quantum circuit approaches to machine learning have been proposed in recent years, with one promising class of variational algorithms involving tensor networks…
Predicting human-generated bitstreams using classical and quantum models
Alex Bocharov, Michael Freedman, Eshan Kemp +2
A school of thought contends that human decision making exhibits quantum-like logic. While it is not known whether the brain may indeed be driven by actual quantum mechanisms, some…
Optimizing Clifford gate generation for measurement-only topological quantum computation with Majorana zero modes
Alan Tran, Alex Bocharov, Bela Bauer +1
One of the main challenges for quantum computation is that while the number of gates required to perform a non-trivial quantum computation may be very large, decoherence and errors…
Quantum Language Processing
Nathan Wiebe, Alex Bocharov, Paul Smolensky +2
We present a representation for linguistic structure that we call a Fock-space representation, which allows us to embed problems in language processing into small quantum devices.…
Circuit-centric quantum classifiers
Maria Schuld, Alex Bocharov, Krysta Svore +1
The current generation of quantum computing technologies call for quantum algorithms that require a limited number of qubits and quantum gates, and which are robust against errors.…
A Note on Optimality of Quantum Circuits over Metaplectic Basis
Alex Bocharov
Metaplectic quantum basis is a universal multi-qutrit quantum basis, formed by the ternary Clifford group and the axial reflection gate $R=|0\rangle \langle 0| + |1\rangle \langle…
Factoring with Qutrits: Shor's Algorithm on Ternary and Metaplectic Quantum Architectures
Alex Bocharov, Martin Roetteler, Krysta M. Svore
We determine the cost of performing Shor's algorithm for integer factorization on a ternary quantum computer, using two natural models of universal fault-tolerant computing: (i) a…
Improved Quantum Ternary Arithmetics
Alex Bocharov, Shawn X. Cui, Martin Roetteler +1
Qutrit (or ternary) structures arise naturally in many quantum systems, particularly in certain non-abelian anyon systems. We present efficient circuits for ternary reversible and…
A Framework for Approximating Qubit Unitaries
Vadym Kliuchnikov, Alex Bocharov, Martin Roetteler +1
We present an algorithm for efficiently approximating of qubit unitaries over gate sets derived from totally definite quaternion algebras. It achieves -approximations…
Efficient Topological Compilation for Weakly-Integral Anyon Model
Alex Bocharov, Shawn X. Cui, Vadym Kliuchnikov +1
A class of anyonic models for universal quantum computation based on weakly-integral anyons has been recently proposed. While universal set of gates cannot be obtained in this cont…
Optimal Ancilla-free Pauli+V Circuits for Axial Rotations
Andreas Blass, Alex Bocharov, Yuri Gurevich
Recently Neil Ross and Peter Selinger analyzed the problem of approximating z- rotations by means of single-qubit Clifford+T circuits. Their main contribution is a deterministic-se…
Efficient Approximation of Diagonal Unitaries over the Clifford+T Basis
Jonathan Welch, Alex Bocharov, Krysta M. Svore
We present an algorithm for the approximate decomposition of diagonal operators, focusing specifically on decompositions over the Clifford+ basis, that minimize the number of ph…
Efficient synthesis of probabilistic quantum circuits with fallback
Alex Bocharov, Martin Roetteler, Krysta M. Svore
Recently it has been shown that Repeat-Until-Success (RUS) circuits can approximate a given single-qubit unitary with an expected number of gates of about of what is requ…
Efficient synthesis of universal Repeat-Until-Success circuits
Alex Bocharov, Martin Roetteler, Krysta M. Svore
Recently, it was shown that Repeat-Until-Success (RUS) circuits can achieve a times reduction in expected -count over ancilla-free techniques for single-qubit unitary deco…
Asymptotically Optimal Topological Quantum Compiling
Vadym Kliuchnikov, Alex Bocharov, Krysta M. Svore
In a topological quantum computer, universality is achieved by braiding and quantum information is natively protected from small local errors. We address the problem of compiling s…
Efficient Decomposition of Single-Qubit Gates into Basis Circuits
Alex Bocharov, Yuri Gurevich, Krysta M. Svore
We develop the first constructive algorithms for compiling single-qubit unitary gates into circuits over the universal basis. The basis is an alternative universal basis to…
A Depth-Optimal Canonical Form for Single-qubit Quantum Circuits
Alex Bocharov, Krysta M. Svore
Given an arbitrary single-qubit operation, an important task is to efficiently decompose this operation into an (exact or approximate) sequence of fault-tolerant quantum operations…