Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Aarthi Sundaram"'
Autor:
Padraig Timoney, Carrie Yurkon, Jusang Lee, Mark Altwerger, Felix Beaudoin, Aarthi Sundaram, Bert Pfefferling
Publikováno v:
2023 34th Annual SEMI Advanced Semiconductor Manufacturing Conference (ASMC).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ed820cd3bb3e82dd618ed43e0c268a02
https://doi.org/10.1109/asmc57536.2023.10121101
https://doi.org/10.1109/asmc57536.2023.10121101
Publikováno v:
SSRN Electronic Journal.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::00bed55ec37f22282a9483668fb8d747
https://doi.org/10.2139/ssrn.4403544
https://doi.org/10.2139/ssrn.4403544
Publikováno v:
Electronic Proceedings in Theoretical Computer Science. 340:279-290
The Heisenberg representation of quantum operators provides a powerful technique for reasoning about quantum circuits, albeit those restricted to the common (non-universal) Clifford set H, S and CNOT. The Gottesman-Knill theorem showed that we can us
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6baf157d492dcb5595179d9eb561188e
https://doi.org/10.4204/eptcs.340.14
https://doi.org/10.4204/eptcs.340.14
Autor:
Aarthi Sundaram, Chitrakala Sakthivel
Publikováno v:
Concurrency and Computation: Practice and Experience. 34
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6c1c9845ebc6cc396a01100a681acf08
https://doi.org/10.1002/cpe.7114
https://doi.org/10.1002/cpe.7114
Publikováno v:
SIAM Journal on Computing
SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2021, 50 (3), pp.972-1013. ⟨10.1137/20M1344202⟩
SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2021, 50 (3), pp.972-1013. ⟨10.1137/20M1344202⟩
In this paper we study the quantum learnability of constant-depth classical circuits under the uniform distribution and in the distribution-independent framework of PAC learning. In order to attain our results, we establish connections between quantu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::21b0175945df5f91a286f5bd6d3be188
https://hal.archives-ouvertes.fr/hal-03043254
https://hal.archives-ouvertes.fr/hal-03043254
Publikováno v:
Theory of Cryptography ISBN: 9783030904586
TCC (1)
TCC (1)
Quantum cryptography is known for enabling functionalities that are unattainable using classical information alone. Recently, Secure Software Leasing (SSL) has emerged as one of these areas of interest. Given a target circuit $C$ from a circuit class
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8b799d8253bcd69257b60ae74ec0b230
https://ir.cwi.nl/pub/32833
https://ir.cwi.nl/pub/32833
Autor:
Thomas Hoppe, Fionnguala Sherry-Brennan, Aarthi Sundaram, Patrick Devine-Wright, Anatol Valerian Itten
Publikováno v:
Energy Research and Social Science, 74
Providing heat is a key aspect of social life and a necessity for comfort and health in cold climates. Even though heat accounts for a large proportion of worldwide carbon emissions and is the largest energy end-use, it has remained largely untouched
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::663e7db45acfced985380f5c6fa7c74d
http://resolver.tudelft.nl/uuid:55ce45af-6c92-468b-a343-4ae06c0bf71c
http://resolver.tudelft.nl/uuid:55ce45af-6c92-468b-a343-4ae06c0bf71c
We establish the first general connection between the design of quantum algorithms and circuit lower bounds. Specifically, let C be a class of polynomial-size concepts, and suppose that C can be PAC-learned with membership queries under the uniform d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bf599bc36bf5651cadfaea38ee88ca67
https://hal.archives-ouvertes.fr/hal-03040161
https://hal.archives-ouvertes.fr/hal-03040161
Publikováno v:
Theory of Computing. 14:1-27
A canonical result about satisfiability theory is that the 2-SAT problem can be solved in linear time, despite the NP-hardness of the 3-SAT problem. In the quantum 2-SAT problem, we are given a family of 2-qubit projectors $\Pi_{ij}$ on a system of $
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4c9ba8ab5c798b4ad9d3bbb91d81f101
https://doi.org/10.4086/toc.2018.v014a001
https://doi.org/10.4086/toc.2018.v014a001