Search Results - "Mukhopadhyay, Priyanka"

Refine Results
  1. 1

    CS-count-optimal quantum circuits for arbitrary multi-qubit unitaries by Mukhopadhyay, Priyanka

    Published in Scientific reports (17-06-2024)
    “…In quantum computing there are quite a few universal gate sets, each having their own characteristics. In this paper we study the Clifford+CS universal…”
    Get full text
    Journal Article
  2. 2

    Faster Provable Sieving Algorithms for the Shortest Vector Problem and the Closest Vector Problem on Lattices in ℓp Norm by Mukhopadhyay, Priyanka

    Published in Algorithms (01-12-2021)
    “…In this work, we give provable sieving algorithms for the Shortest Vector Problem (SVP) and the Closest Vector Problem (CVP) on lattices in ℓp norm (1≤p≤∞)…”
    Get full text
    Journal Article
  3. 3

    T-count and T-depth of any multi-qubit unitary by Gheorghiu, Vlad, Mosca, Michele, Mukhopadhyay, Priyanka

    Published in npj quantum information (30-11-2022)
    “…We design an algorithm to determine the (minimum) T-count of any n -qubit ( n  ≥ 1) unitary W of size 2 n  × 2 n , over the Clifford+T gate set. The space and…”
    Get full text
    Journal Article
  4. 4

    Synthesizing efficient circuits for Hamiltonian simulation by Mukhopadhyay, Priyanka, Wiebe, Nathan, Zhang, Hong Tao

    Published in npj quantum information (03-04-2023)
    “…We provide an approach for compiling quantum simulation circuits that appear in Trotter, qDRIFT and multi-product formulas to Clifford and non-Clifford…”
    Get full text
    Journal Article
  5. 5

    A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits by Gheorghiu, Vlad, Mosca, Michele, Mukhopadhyay, Priyanka

    Published in npj quantum information (13-09-2022)
    “…We investigate the problem of synthesizing T-depth optimal quantum circuits for exactly implementable unitaries over the Clifford+T gate set. We construct a…”
    Get full text
    Journal Article
  6. 6

    Adaptive estimation of quantum observables by Shlosberg, Ariel, Jena, Andrew J., Mukhopadhyay, Priyanka, Haase, Jan F., Leditzky, Felix, Dellantonio, Luca

    Published in Quantum (Vienna, Austria) (26-01-2023)
    “…The accurate estimation of quantum observables is a critical task in science. With progress on the hardware, measuring a quantum system will become…”
    Get full text
    Journal Article
  7. 7

    A survey of Hough Transform by Mukhopadhyay, Priyanka, Chaudhuri, Bidyut B.

    Published in Pattern recognition (01-03-2015)
    “…In 1962 Hough earned the patent for a method [1], popularly called Hough Transform (HT) that efficiently identifies lines in images. It is an important tool…”
    Get full text
    Journal Article
  8. 8

    The Projection Games Conjecture and the hardness of approximation of super-SAT and related problems by Mukhopadhyay, Priyanka

    Published in Journal of computer and system sciences (01-02-2022)
    “…The Super-SAT (SSAT) problem was introduced in [1,2] to prove the NP-hardness of approximation of two popular lattice problems - Shortest Vector Problem and…”
    Get full text
    Journal Article
  9. 9

    Composability of global phase invariant distance and its application to approximation error management by Mukhopadhyay, Priyanka

    Published in Journal of physics communications (01-11-2021)
    “…Abstract 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…”
    Get full text
    Journal Article
  10. 10

    Reducing the CNOT count for Clifford+T circuits on NISQ architectures by Gheorghiu, Vlad, Huang, Jiaxin, Li, Sarah Meng, Mosca, Michele, Mukhopadhyay, Priyanka

    “…While mapping a quantum circuit to the physical layer one has to consider the numerous constraints imposed by the underlying hardware architecture…”
    Get full text
    Journal Article
  11. 11

    Sparse multivariate polynomial interpolation on the basis of Schubert polynomials by Mukhopadhyay, Priyanka, Qiao, Youming

    Published in Computational complexity (01-12-2017)
    “…Schubert polynomials were discovered by A. Lascoux and M. Schützenberger in the study of cohomology rings of flag manifolds in 1980s. These polynomials…”
    Get full text
    Journal Article
  12. 12

    Quantum Simulation of the First-Quantized Pauli-Fierz Hamiltonian by Mukhopadhyay, Priyanka, Stetina, Torin F., Wiebe, Nathan

    Published in PRX quantum (15-03-2024)
    “…We provide an explicit recursive divide-and-conquer approach for simulating quantum dynamics and derive a discrete first-quantized nonrelativistic QED…”
    Get full text
    Journal Article
  13. 13

    A study on fluoride bioremediation via a novel bacterium Bacillus megaterium (JF273850) isolated from agricultural soil by Pal, Kartick Chandra, Mukhopadhyay, Priyanka, Chatterjee, Soumendranath, Mondal, Naba Kumar

    Published in Journal of Earth System Science (23-08-2022)
    “…Micro-organisms often exhibit tolerance to a wide range of pollutants for their existence in different adverse environments. Fluoride is one of the potential…”
    Get full text
    Journal Article
  14. 14

    Characterization and control of symbiotic Bacillus cereus isolated from the mid gut of Anopheles subpictus Grassi by Mukhopadhyay, Priyanka, Chatterjee, Soumendranath

    Published in Journal of parasitic diseases (01-12-2016)
    “…An investigation was done to find out the role of gut bacterium on the larval development and survival of Anopheles subpictus , the vector responsible for the…”
    Get full text
    Journal Article
  15. 15

    New One Shot Quantum Protocols With Application to Communication Complexity by Anshu, Anurag, Jain, Rahul, Mukhopadhyay, Priyanka, Shayeghi, Ala, Penghui Yao

    Published in IEEE transactions on information theory (01-12-2016)
    “…In this paper, we present the following quantum compression protocol `P': Let ρ,σ be quantum states, such that S (ρ∥σ) def = Tr(ρ log ρ - ρ log σ), the…”
    Get full text
    Journal Article
  16. 16

    A quantum random access memory (QRAM) using a polynomial encoding of binary strings by Mukhopadhyay, Priyanka

    Published 28-08-2024
    “…Quantum algorithms claim significant speedup over their classical counterparts for solving many problems. An important aspect of many of these algorithms is…”
    Get full text
    Journal Article
  17. 17

    Synthesizing Toffoli-optimal quantum circuits for arbitrary multi-qubit unitaries by Mukhopadhyay, Priyanka

    Published 16-01-2024
    “…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…”
    Get full text
    Journal Article
  18. 18

    Information Theoretic and Algebraic Techniques in Theoretical Computer Science by Mukhopadhyay, Priyanka

    Published 01-01-2018
    “…This thesis can be divided into four independent parts. 1.We give a one-round entanglement assisted quantum compression protocol that allows Alice and Bob…”
    Get full text
    Dissertation
  19. 19

    Composability of global phase invariant distance and its application to approximation error management by Mukhopadhyay, Priyanka

    Published 23-11-2021
    “…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…”
    Get full text
    Journal Article
  20. 20

    The Projection Games Conjecture and the Hardness of Approximation of super-SAT and related problems by Mukhopadhyay, Priyanka

    Published 05-10-2021
    “…Journal of Computer and System Sciences, 123 (2022) 186-201 The Super-SAT or SSAT problem was introduced by Dinur et al.(2002,2003) to prove the NP-hardness of…”
    Get full text
    Journal Article