Search Results for author: Priyanka Mukhopadhyay

Found 3 papers, 2 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

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

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

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