P Mukhopadhyay - arXiv preprint arXiv:2401.08950, 2024 - arxiv.org
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 with this …
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 …
Quantum symmetrization is the task of transforming a non-strictly increasing list of $ n $ integers into an equal superposition of all permutations of the list (or more generally …
P Mukhopadhyay - arXiv preprint arXiv:2408.16794, 2024 - arxiv.org
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 …
When one considers quantum computation, one typically thinks about unitary evolution acting on a system of two-level qubit systems. All the proposed fault-tolerant quantum …