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

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.