10 citations · 22 across the 11 of their papers we have counts for
12 papers
Approximate cloning of structured pure states
Yaroslav Herasymenko, Junqiao Lin, Philip Verduyn Lunel +1
The no-cloning theorem is a cornerstone result in quantum mechanics that forbids copying of general quantum information. More quantitatively, even given copies of an unknown st…
Quantum gate lower bounds for loss-tolerant position verification
Alex May, Philip Verduyn Lunel
Quantum position-verification is a cryptographic task wherein a verifier attempts to establish the location in space of a prover. Recent experiments have implemented a well-studied…
Equivalence of non-local computation tasks beyond Clifford operations
Andreas Bluhm, Simon Höfer, Alex May +2
Non-local quantum computation (NLQC) studies how two collaborating players can implement channels on distributed systems using a single simultaneous round of quantum communication…
A complexity theory for non-local quantum computation
Andreas Bluhm, Simon Höfer, Alex May +3
Non-local quantum computation (NLQC) replaces a local interaction between two systems with a single round of communication and shared entanglement. Despite many partial results, it…
Towards experimental demonstration of quantum position verification using true single photons
Kirsten Kanneworff, Mio Poortvliet, Dirk Bouwmeester +6
The geographical position can be a good credential for authentication of a party, this is the basis of position-based cryptography - but classically this cannot be done securely wi…
Permutation tests for quantum state identity
Harry Buhrman, Dmitry Grinko, Philip Verduyn Lunel +1
The quantum analogue of the equality function, known as the quantum state identity problem, is the task of deciding whether unknown quantum states are equal or unequal, given t…
Making Existing Quantum Position Verification Protocols Secure Against Arbitrary Transmission Loss
Rene Allerstorfer, Andreas Bluhm, Harry Buhrman +4
Signal loss poses a significant threat to the security of quantum cryptography when the chosen protocol lacks loss-tolerance. In quantum position verification (QPV) protocols, even…
Monogamy of highly symmetric states
Rene Allerstorfer, Matthias Christandl, Dmitry Grinko +4
We investigate the extent to which two particles can be maximally entangled when they are also similarly entangled with other particles on a complete graph, focusing on Werner, iso…
Security of a Continuous-Variable based Quantum Position Verification Protocol
Rene Allerstorfer, Llorenç Escolà-Farràs, Arpan Akash Ray +3
In this work we study quantum position verification with continuous-variable quantum states. In contrast to existing discrete protocols, we present and analyze a protocol that util…
Relating non-local quantum computation to information theoretic cryptography
Rene Allerstorfer, Harry Buhrman, Alex May +2
Non-local quantum computation (NLQC) is a cheating strategy for position-verification schemes, and has appeared in the context of the AdS/CFT correspondence. Here, we connect NLQC…
On the Role of Quantum Communication and Loss in Attacks on Quantum Position Verification
Rene Allerstorfer, Harry Buhrman, Florian Speelman +1
We study the role of quantum communication in attacks on quantum position verification. In this work, we construct the first known example of a QPV protocol that is provably secure…
Towards practical and error-robust quantum position verification
Rene Allerstorfer, Harry Buhrman, Florian Speelman +1
Loss of inputs can be detrimental to the security of quantum position verification (QPV) protocols, as it may allow attackers to not answer on all played rounds, but only on those…