4 citations · 9 across the 5 of their papers we have counts for
5 papers
Improved quantum circuits for division
Priyanka Mukhopadhyay, Alexandru Gheorghiu, Hari Krovi
Arithmetic operations are an important component of many quantum algorithms. Optimizing quantum circuits for these operations therefore leads to more efficient implementations of t…
Optimizing the non-Clifford-count in unitary synthesis using Reinforcement Learning
David Kremer, Ali Javadi-Abhari, Priyanka Mukhopadhyay
In this paper we study the potential of using reinforcement learning (RL) in order to synthesize quantum circuits, while optimizing the T-count and CS-count, of unitaries that are…
A quantum random access memory (QRAM) using a polynomial encoding of binary strings
Priyanka Mukhopadhyay
Quantum algorithms claim significant speedup over their classical counterparts for solving many problems. An important aspect of many of these algorithms is the existence of a quan…
Scattering Processes from Quantum Simulation Algorithms for Scalar Field Theories
Andrew Hardy, Priyanka Mukhopadhyay, M. Sohaib Alam +8
We provide practical simulation methods for scalar field theories on a quantum computer that yield improved asymptotics as well as concrete gate estimates for the simulation and ph…
Synthesizing Toffoli-optimal quantum circuits for arbitrary multi-qubit unitaries
Priyanka Mukhopadhyay
In this paper we study the Clifford+Toffoli universal fault-tolerant gate set. We introduce a generating set in order to represent any unitary implementable by this gate set and wi…