19 citations · 25 across the 4 of their papers we have counts for
15 papers
Graphical and algebraic methods for Boolean factoring
Simon Martiel, Priyanka Mukhopadhyay
The problem of factoring Boolean polynomials has significant applications in both classical and quantum computing technology. In this paper we have developed novel algorithms for f…
Quantum Simulation of the First-Quantized Pauli-Fierz Hamiltonian
Priyanka Mukhopadhyay, Torin F. Stetina, Nathan Wiebe
We provide an explicit recursive divide and conquer approach for simulating quantum dynamics and derive a discrete first quantized non-relativistic QED Hamiltonian based on the man…
Synthesizing efficient circuits for Hamiltonian simulation
Priyanka Mukhopadhyay, Nathan Wiebe, Hong Tao Zhang
We provide a new approach for compiling quantum simulation circuits that appear in Trotter, qDRIFT and multi-product formulas to Clifford and non-Clifford operations that can reduc…
Adaptive estimation of quantum observables
Ariel Shlosberg, Andrew J. Jena, Priyanka Mukhopadhyay +3
The accurate estimation of quantum observables is a critical task in science. With progress on the hardware, measuring a quantum system will become increasingly demanding, particul…
T-count and T-depth of any multi-qubit unitary
Vlad Gheorghiu, Michele Mosca, Priyanka Mukhopadhyay
While implementing a quantum algorithm it is crucial to reduce the quantum resources, in order to obtain the desired computational advantage. For most fault-tolerant quantum error-…
Composability of global phase invariant distance and its application to approximation error management
Priyanka Mukhopadhyay
Many quantum algorithms can be written as a composition of unitaries, some of which can be exactly synthesized by a universal fault-tolerant gate set, while others can be approxima…