Zobrazeno 1 - 10
of 929
pro vyhledávání: '"Chen, Lijie"'
The `quantum gravity in the lab' paradigm suggests that quantum computers might shed light on quantum gravity by simulating the CFT side of the AdS/CFT correspondence and mapping the results to the AdS side. This relies on the assumption that the dua
Externí odkaz:
http://arxiv.org/abs/2411.04978
We show that there is a constant $k$ such that Buss's intuitionistic theory $\mathsf{IS}^1_2$ does not prove that SAT requires co-nondeterministic circuits of size at least $n^k$. To our knowledge, this is the first unconditional unprovability result
Externí odkaz:
http://arxiv.org/abs/2404.11841
We show that there is a language in $\mathsf{S}_2\mathsf{E}/_1$ (symmetric exponential time with one bit of advice) with circuit complexity at least $2^n/n$. In particular, the above also implies the same near-maximum circuit lower bounds for the cla
Externí odkaz:
http://arxiv.org/abs/2309.12912
A randomized algorithm for a search problem is *pseudodeterministic* if it produces a fixed canonical solution to the search problem with high probability. In their seminal work on the topic, Gat and Goldwasser posed as their main open problem whethe
Externí odkaz:
http://arxiv.org/abs/2305.15140
Autor:
Chen, Lijie1,2,3 (AUTHOR), Wang, Xiao1 (AUTHOR), Deng, Qingyang1 (AUTHOR), Wang, He1,2 (AUTHOR) wanghe502@126.com, Luo, Baoyou1 (AUTHOR), Tang, Ting1 (AUTHOR)
Publikováno v:
Scientific Reports. 10/11/2024, Vol. 14 Issue 1, p1-11. 11p.
Autor:
Chen, Lijie, Movassagh, Ramis
Recently Chen and Movassagh proposed the quantum Merkle tree, which is a quantum analogue of the well-known classical Merkle tree. It gives a succinct verification protocol for quantum state commitment. Although they only proved security against semi
Externí odkaz:
http://arxiv.org/abs/2209.10798
Publikováno v:
TheoretiCS, Volume 3 (February 15, 2024) theoretics:9259
For a complexity class $C$ and language $L$, a constructive separation of $L \notin C$ gives an efficient algorithm (also called a refuter) to find counterexamples (bad inputs) for every $C$-algorithm attempting to decide $L$. We study the questions:
Externí odkaz:
http://arxiv.org/abs/2203.14379
Publikováno v:
In Theoretical and Applied Mechanics Letters November 2024 14(6)
Publikováno v:
In Engineering Geology November 2024 341
Publikováno v:
In Journal of Cleaner Production 5 October 2024 474