Zobrazeno 1 - 10
of 78
pro vyhledávání: '"Thomas Vidick"'
Publikováno v:
Discrete Analysis (2022)
Quantum soundness of testing tensor codes, Discrete Analysis 2022:17, 73 pp. This paper proves an essential component of a major recent result in complexity theory, known as the MIP*=RE theorem, which was proved by the same authors. MIP* and RE are
Externí odkaz:
https://doaj.org/article/2362d201892941dcbf047030dd16d93d
Autor:
Eric Culf, Thomas Vidick
Publikováno v:
Quantum, Vol 6, p 791 (2022)
We establish a strong monogamy-of-entanglement property for subspace coset states, which are uniform superpositions of vectors in a linear subspace of $\mathbb{F}_2^n$ to which has been applied a quantum one-time pad. This property was conjectured re
Externí odkaz:
https://doaj.org/article/29c6a8d8ddb547eb978401f076661ff4
Publikováno v:
Nature Communications, Vol 9, Iss 1, Pp 1-11 (2018)
The security of DIQKD is difficult to prove, as one needs to take into account every possible attack strategy. Here, the authors develop a method to determine the entropy of a system as the sum of the entropies of its parts. Applied to DIQKD, this im
Externí odkaz:
https://doaj.org/article/b145f0c07f1844859fe7a39939946b6c
Autor:
Tony Metger, Thomas Vidick
Publikováno v:
Quantum, Vol 5, p 544 (2021)
Self-testing is a method to characterise an arbitrary quantum system based only on its classical input-output correlations, and plays an important role in device-independent quantum information processing as well as quantum complexity theory. Prior w
Externí odkaz:
https://doaj.org/article/85dd478d3a75491c9c146048acfae468
Publikováno v:
Quantum, Vol 4, p 349 (2020)
We introduce a three-player nonlocal game, with a finite number of classical questions and answers, such that the optimal success probability of $1$ in the game can only be achieved in the limit of strategies using arbitrarily high-dimensional entang
Externí odkaz:
https://doaj.org/article/69ffdaef01c14f2a82f5815e0e86553c
Autor:
Thomas Vidick, Tina Zhang
Publikováno v:
Quantum, Vol 4, p 266 (2020)
We show that every language in QMA admits a classical-verifier, quantum-prover zero-knowledge argument system which is sound against quantum polynomial-time provers and zero-knowledge for classical (and quantum) polynomial-time verifiers. The protoco
Externí odkaz:
https://doaj.org/article/5622817137c84c20873688ef60a5de4d
Publikováno v:
Quantum, Vol 2, p 92 (2018)
Bell-inequality violations establish that two systems share some quantum entanglement. We give a simple test to certify that two systems share an asymptotically large amount of entanglement, $n$ EPR states. The test is efficient: unlike earlier tests
Externí odkaz:
https://doaj.org/article/bacdcb1d4a8447a5a1aa99c81502dee7
Publikováno v:
Quantum, Vol 1, p 16 (2017)
In this work we consider the ground space connectivity problem for commuting local Hamiltonians. The ground space connectivity problem asks whether it is possible to go from one (efficiently preparable) state to another by applying a polynomial lengt
Externí odkaz:
https://doaj.org/article/b1ebe31f763e46c99648f111016f19fa
Publikováno v:
Communications of the ACM. 64:131-138
Note from the Research Highlights Co-Chairs: A Research Highlights paper appearing in Communications is usually peer-reviewed prior to publication. The following paper is unusual in that it is still under review. However, the result has generated eno
Autor:
Thomas Vidick
Publikováno v:
SIAM Journal on Computing. 49:1423-1427
This note indicates an error in the proof of Theorem 3.1 in [T. Vidick, SIAM J. Comput., 45 (2016), pp. 1007--1063]. Due to an induction step in the soundness analysis not being carried out correct...