Zobrazeno 1 - 10
of 1 006
pro vyhledávání: '"Quantum complexity theory"'
Autor:
Chia, Nai-Hui, Chung, Kai-Min, Hsieh, Yao-Ching, Lin, Han-Hsuan, Lin, Yao-Ting, Shen, Yu-Ching
Hamiltonian simulation is one of the most important problems in the field of quantum computing. There have been extended efforts on designing algorithms for faster simulation, and the evolution time T for the simulation greatly affect algorithm runti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2fd39687ef1bcace39f927b2d7792cc9
http://arxiv.org/abs/2305.12444
http://arxiv.org/abs/2305.12444
We study variable time search, a form of quantum search where queries to different items take different time. Our first result is a new quantum algorithm that performs variable time search with complexity O(√Tlog n) where T = ∑_{i = 1}ⁿ t_i² w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2b4e34cfe3a8dbba0ac08756a533e2a0
The physically motivated quantum generalisation of k-SAT, the k-Local Hamiltonian (k-LH) problem, is well-known to be QMA-complete ("quantum NP"-complete). What is surprising, however, is that while the former is easy on 1D Boolean formulae, the latt
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::93c3daecdab7d3d316de721b7987dd8e
Autor:
Beame, Paul, Kornerup, Niels
Cumulative memory -- the sum of space used per step over the duration of a computation -- is a fine-grained measure of time-space complexity that was introduced to analyze cryptographic applications like password hashing. It is a more accurate cost m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3b7cf9d6da80b77f8b886760afbb2795
The recently-defined No Low-energy Sampleable States (NLSS) conjecture of Gharibian and Le Gall [Sevag Gharibian and François {Le Gall}, 2022] posits the existence of a family of local Hamiltonians where all states of low-enough constant energy do n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::33ffb6008d049712c1446242d3c3ced6
Autor:
Aaronson, Scott, Grewal, Sabee
We give an efficient algorithm that learns a non-interacting-fermion state, given copies of the state. For a system of n non-interacting fermions and m modes, we show that O(m³ n² log(1/δ) / ε⁴) copies of the input state and O(m⁴ n² log(1/δ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cd098897d1d485d045897c0a3726e844
Variational Quantum Algorithms (VQAs), such as the Quantum Approximate Optimization Algorithm (QAOA) of [Farhi, Goldstone, Gutmann, 2014], have seen intense study towards near-term applications on quantum hardware. A crucial parameter for VQAs is the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::544455fb2fca308eeb8cb384f3788bf4
Autor:
Vidick, Thomas
The study of multiprover interactive proof systems, of locally testable codes, and of property testing are deeply linked, conceptually if not formally, through their role in the proof of the PCP theorem in complexity theory. Recently there has been s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f16e452632c091533d024d3f78251fe1
In the classical model of computation, it is well established that one-way functions (OWF) are minimal for computational cryptography: They are essential for almost any cryptographic application that cannot be realized with respect to computationally
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0f777229ffcedf0575c67ae67c1c6607
Autor:
Cade, Chris, Folkertsma, Marten, Gharibian, Sevag, Hayakawa, Ryu, Le Gall, François, Morimae, Tomoyuki, Weggemans, Jordi
Estimating the ground state energy of a local Hamiltonian is a central problem in quantum chemistry. In order to further investigate its complexity and the potential of quantum algorithms for quantum chemistry, Gharibian and Le Gall (STOC 2022) recen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ca6ff3dfd2979a8589721e00aa3dbf30