Search Results for author: Michele Mosca

Found 11 papers, 6 papers with code

A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits

1 code implementation8 Jan 2021 Vlad Gheorghiu, Michele Mosca, Priyanka Mukhopadhyay

We get an algorithm with space and time complexity $O\left(\left(4^{n^2}\right)^{\lceil d/c\rceil}\right)$ and $O\left(\left(4^{n^2}\right)^{(c-1)\lceil d/c\rceil}\right)$ respectively, where $d$ is the minimum T-depth and $c\geq 2$ is a constant.

Quantum Physics

Reducing the CNOT count for Clifford+T circuits on NISQ architectures

no code implementations24 Nov 2020 Vlad Gheorghiu, Sarah Meng Li, Michele Mosca, Priyanka Mukhopadhyay

While mapping a quantum circuit to the physical layer one has to consider the numerous constraints imposed by the underlying hardware architecture.

Quantum Physics

A polynomial time and space heuristic algorithm for T-count

1 code implementation22 Jun 2020 Michele Mosca, Priyanka Mukhopadhyay

Given an oracle for COUNT-T, we can compute a T-count-optimal circuit in time polynomial in the T-count and dimension of $U$.

Quantum Physics

Quantum circuit optimizations for NISQ architectures

no code implementations3 Apr 2019 Beatrice Nash, Vlad Gheorghiu, Michele Mosca

In this work we construct a circuit synthesis scheme that takes as input the qubit connectivity graph and a quantum circuit over the gate set generated by $\{\text{CNOT}, R_{Z}\}$ and outputs a circuit that respects the connectivity of the device.

Quantum Physics

Fault tolerant resource estimation of quantum random-access memories

1 code implementation4 Feb 2019 Olivia Di Matteo, Vlad Gheorghiu, Michele Mosca

In some cases, the cost of such quantum random-access memory (qRAM) is the limiting factor in the implementation of the algorithm.

Quantum Physics

The Engineering of a Scalable Multi-Site Communications System Utilizing Quantum Key Distribution (QKD)

no code implementations7 Dec 2017 Piotr K. Tysowski, Xinhua Ling, Norbert Lütkenhaus, Michele Mosca

A network layer provides key generation across a network of nodes connected by quantum links.

Cryptography and Security Networking and Internet Architecture Quantum Physics

On the robustness of bucket brigade quantum RAM

no code implementations11 Feb 2015 Srinivasan Arunachalam, Vlad Gheorghiu, Tomas Jochym-O'Connor, Michele Mosca, Priyaa Varshinee Srinivasan

We introduce a circuit model for the quantum bucket brigade architecture and argue that quantum error correction for the circuit causes the quantum bucket brigade architecture to lose its primary advantage of a small number of "active" gates, since all components have to be actively error corrected.

Quantum Physics

Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning

1 code implementation8 Mar 2013 Matthew Amy, Dmitri Maslov, Michele Mosca

Most work in quantum circuit optimization has been performed in isolation from the results of quantum fault-tolerance.

Quantum Physics Emerging Technologies

Practical approximation of single-qubit unitaries by single-qubit quantum Clifford and T circuits

1 code implementation31 Dec 2012 Vadym Kliuchnikov, Dmitri Maslov, Michele Mosca

We present an algorithm, along with its implementation that finds T-optimal approximations of single-qubit Z-rotations using quantum circuits consisting of Clifford and T gates.

Quantum Physics Emerging Technologies

Fast and efficient exact synthesis of single qubit unitaries generated by Clifford and T gates

1 code implementation22 Jun 2012 Vadym Kliuchnikov, Dmitri Maslov, Michele Mosca

In this paper, we show the equivalence of the set of unitaries computable by the circuits over the Clifford and T library and the set of unitaries over the ring $\mathbb{Z}[\frac{1}{\sqrt{2}}, i]$, in the single-qubit case.

Quantum Physics Emerging Technologies

Quantum Lower Bounds by Polynomials

no code implementations18 Feb 1998 Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf

We examine the number T of queries that a quantum network requires to compute several Boolean functions on {0, 1}^N in the black-box model.

Quantum Physics Computational Complexity

Cannot find the paper you are looking for? You can Submit a new open access paper.