You need to log in to edit.

You can create a new account if you don't have one.

Or, discuss a change on Slack.

You can create a new account if you don't have one.

Or, discuss a change on Slack.

1 code implementation • 8 Jan 2021 • Vlad Gheorghiu, Michele Mosca, Priyanka Mukhopadhyay

This is much better than the complexity of the algorithm by Amy et al.(2013), the previous best with a complexity $O\left(\left(3^n\cdot 2^{kn^2}\right)^{\lceil \frac{d}{2}\rceil}\cdot 2^{kn^2}\right)$, where $k>2. 5$ is a constant.

Quantum Physics

no code implementations • 24 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

1 code implementation • 22 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

no code implementations • 3 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

1 code implementation • 4 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

no code implementations • 7 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

no code implementations • 11 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

1 code implementation • 8 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

1 code implementation • 31 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

1 code implementation • 22 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

no code implementations • 18 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.

Contact us on:
hello@paperswithcode.com
.
Papers With Code is a free resource with all data licensed under CC-BY-SA.