default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPriyanka Mukhopadhyay
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j7]Ariel Shlosberg, Andrew J. Jena, Priyanka Mukhopadhyay, Jan F. Haase, Felix Leditzky, Luca Dellantonio:
Adaptive estimation of quantum observables. Quantum 7: 906 (2023)- [j6]Vlad Gheorghiu, Jiaxin Huang
, Sarah Meng Li, Michele Mosca, Priyanka Mukhopadhyay:
Reducing the CNOT Count for Clifford+T Circuits on NISQ Architectures. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 42(6): 1873-1884 (2023) - 2022
- [j5]Priyanka Mukhopadhyay:
The Projection Games Conjecture and the hardness of approximation of super-SAT and related problems. J. Comput. Syst. Sci. 123: 186-201 (2022) - 2021
- [j4]Priyanka Mukhopadhyay:
Faster Provable Sieving Algorithms for the Shortest Vector Problem and the Closest Vector Problem on Lattices in ℓp Norm. Algorithms 14(12): 362 (2021) - 2017
- [j3]Priyanka Mukhopadhyay, Youming Qiao:
Sparse multivariate polynomial interpolation on the basis of Schubert polynomials. Comput. Complex. 26(4): 881-909 (2017) - 2016
- [j2]Anurag Anshu, Rahul Jain, Priyanka Mukhopadhyay, Ala Shayeghi, Penghui Yao:
New One Shot Quantum Protocols With Application to Communication Complexity. IEEE Trans. Inf. Theory 62(12): 7566-7577 (2016) - 2015
- [j1]Priyanka Mukhopadhyay, Bidyut B. Chaudhuri:
A survey of Hough Transform. Pattern Recognit. 48(3): 993-1010 (2015)
Conference and Workshop Papers
- 2018
- [c2]Divesh Aggarwal, Priyanka Mukhopadhyay:
Improved Algorithms for the Shortest Vector Problem and the Closest Vector Problem in the Infinity Norm. ISAAC 2018: 35:1-35:13 - 2017
- [c1]Anurag Anshu, Dmitry Gavinsky, Rahul Jain, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, Swagato Sanyal:
A Composition Theorem for Randomized Query Complexity. FSTTCS 2017: 10:1-10:13
Reference Works
- 2016
- [r1]Anurag Anshu, Vamsi Krishna Devabathini, Rahul Jain, Priyanka Mukhopadhyay:
Teleportation of Quantum States. Encyclopedia of Algorithms 2016: 2205-2209
Informal and Other Publications
- 2022
- [i10]Priyanka Mukhopadhyay, Nathan Wiebe, Hong-Tao Zhang:
Synthesizing efficient circuits for Hamiltonian simulation. CoRR abs/2209.03478 (2022) - 2019
- [i9]Priyanka Mukhopadhyay:
Faster provable sieving algorithms for the Shortest Vector Problem and the Closest Vector Problem on lattices in 𝓁p norm. CoRR abs/1907.04406 (2019) - [i8]Priyanka Mukhopadhyay:
The Projection Games Conjecture and the Hardness of Approximation of SSAT and related problems. CoRR abs/1907.05548 (2019) - 2018
- [i7]Divesh Aggarwal, Priyanka Mukhopadhyay:
Faster algorithms for SVP and CVP in the 𝓁∞ norm. CoRR abs/1801.02358 (2018) - 2017
- [i6]Anurag Anshu, Dmitry Gavinsky, Rahul Jain, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, Swagato Sanyal:
A Composition Theorem for Randomized Query Complexity. CoRR abs/1706.00335 (2017) - [i5]Anurag Anshu, Dmitry Gavinsky, Rahul Jain, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, Swagato Sanyal:
A Composition Theorem for Randomized Query complexity. Electron. Colloquium Comput. Complex. TR17 (2017) - [i4]Anurag Anshu, Naresh B. Goud, Rahul Jain, Srijita Kundu, Priyanka Mukhopadhyay:
Lifting randomized query complexity to randomized communication complexity. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [i3]Ritajit Majumdar, Saikat Basu, Priyanka Mukhopadhyay, Susmita Sur-Kolay:
Error tracing in linear and concatenated quantum circuits. CoRR abs/1612.08044 (2016) - 2015
- [i2]Priyanka Mukhopadhyay, Youming Qiao:
Sparse multivariate polynomial interpolation in the basis of Schubert polynomials. CoRR abs/1504.03856 (2015) - 2014
- [i1]Anurag Anshu, Rahul Jain, Priyanka Mukhopadhyay, Ala Shayeghi, Penghui Yao:
A new operational interpretation of relative entropy and trace distance between quantum states. CoRR abs/1404.1366 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
