A no-signalling-based lifting of commitment techniques yields the first single-shot loss-tolerant QPV protocol with exponential security decay in the commitment threshold k and 3.7% noise robustness.
Simplified instantaneous non-local quantum com- putation with applications to position-based cryptography.New Journal of Physics, 13(9):093036
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
New lower-bound techniques based on controllable correlation and entanglement yield non-trivial bounds for Haar-random two-qubit unitaries and the first known bounds for CNOT, DCNOT, sqrt(SWAP), and XX gates, with a tight result for CNOT.
citing papers explorer
-
Arbitrarily Loss-Tolerant Quantum Position Verification in a Single Execution
A no-signalling-based lifting of commitment techniques yields the first single-shot loss-tolerant QPV protocol with exponential security decay in the commitment threshold k and 3.7% noise robustness.
-
Lower bounds on non-local computation from controllable correlation
New lower-bound techniques based on controllable correlation and entanglement yield non-trivial bounds for Haar-random two-qubit unitaries and the first known bounds for CNOT, DCNOT, sqrt(SWAP), and XX gates, with a tight result for CNOT.