Quantinuum researchers are integrating physical location directly into the security of quantum communications. The team proposes a new method that uses the position of one party as an authentication credential for key distribution, randomly interleaving “quantum position verification” rounds with standard BB84 key generation. This approach offers a potentially more efficient authentication method than previous protocols, which required complete position verification for every authenticated bit. The work addresses a critical vulnerability in quantum key distribution: ensuring parties are communicating with legitimate entities and not unknowingly sharing a key with an attacker.
BB84 QKD with Interleaved Quantum Position Verification
The efficiency of securing quantum keys has received a boost through the interleaving of standard BB84 quantum key distribution with rounds of quantum position verification, a technique that reduces the computational burden of authentication. The protocol’s design centers around establishing trust not just in the security of the key itself, but in the identity of the recipient, ensuring that the encrypted information reaches its intended destination and remains confidential. This is particularly relevant in scenarios demanding high assurance, such as secure military communications where verifying the physical location of a base is paramount.
As the researchers explain, the system aims to ensure that “only somebody physically located at the base will be able to decrypt and read it,” subject to certain assumptions about the underlying technology. Previous classical position verification schemes, while effective against a single attacker, proved vulnerable to coordinated attacks from multiple adversaries sharing information. These networks could circumvent security measures by copying and forwarding inputs, effectively deceiving the verification process.
Quantum position verification, however, proposed a solution by exploiting the no-cloning theorem, which states that an unknown quantum state cannot be perfectly duplicated. The current work builds upon this foundation, streamlining the process by integrating QPV rounds directly into the BB84 protocol, rather than running them as a separate, exhaustive process.
This integration relies on a function, denoted as f, which takes two n-bit strings as input and outputs a round type, either key generation or position verification, along with a measurement basis. The protocol begins with two verifiers sharing a private authenticated communication channel, enabling free exchange of information. They then initiate a process with the prover, located midway between them, to generate a secret key.
The verifiers each transmit a bit string to the prover, who evaluates the function f on these strings. The result dictates both the measurement basis and whether the round is dedicated to key generation or position verification. In key generation rounds, the prover keeps the measurement outcomes secret, while in position verification rounds, the results are used to confirm the prover’s location.
The success of this method hinges on carefully bounding the error rate observed during the protocol, accounting for potential disturbances introduced by attackers attempting to learn the key. A critical metric in assessing the security of this system is the conditional entropy, H(R|AB), which quantifies the uncertainty about the key given the knowledge of the attackers, labeled An and B. Researchers aim to maximize this entropy, effectively minimizing the information available to potential adversaries.
This is achieved by bounding the conditional entropy through the guessing probability, Pg, representing the maximum probability that attackers can correctly guess the verifier’s bit in the key generation rounds. The lower the guessing probability, the more secure the key. The protocol’s effectiveness is further tied to the probability of passing the position verification rounds, Pver, which is influenced by the attack strategy employed.
The analysis considers various attack scenarios, categorizing them based on whether the attackers tamper with the input strings x and y while leaving the transmitted quantum state unchanged, or vice versa. Different attack types result in varying probabilities of guessing the key and passing the position verification checks. The researchers identify three types of tampering: K, U, and M, each representing a different approach to manipulating the quantum state.
The attainable values for Pg and Pver depend on the specific attack strategy employed, with the goal of minimizing the attacker’s ability to compromise the system. The rate derivation reveals that the asymptotic key rate, *κ*, is determined by the difference between the conditional entropy H(R|AB) and the binary entropy H(R|C), which is bounded by h(δ), where *δ* represents the error rate observed by the verifiers in the position verification rounds. Reducing this error rate is therefore important for maximizing the key rate and ensuring secure communication.
Position Verification Using Timing and Quantum Information
The team’s work suggests that a carefully designed function f can significantly enhance the security and efficiency of quantum key distribution systems. The protocol’s design allows for a flexible trade-off between the computational complexity of the function f and the security level achieved.
The choice of f also impacts the error rate observed during the position verification rounds, which in turn affects the overall key rate. The researchers acknowledge that the current analysis is limited to a restricted set of attacks and that further work is needed to assess the protocol’s security against more sophisticated adversaries.
Prover-Based Authentication in Key Distribution Protocols
During key generation, the prover maintains the secrecy of measurement outcomes, while position verification rounds involve transmitting those outcomes back to the verifiers for confirmation. This design introduces unique challenges, particularly the potential for attackers to manipulate instructions sent to the prover, exploiting the lack of prior authentication of the prover’s identity. Addressing this vulnerability requires careful consideration of the function f used by the prover. The security analysis presented in the work highlights the importance of f possessing specific properties, aligning with those found in a specialized family of non-malleable codes.
The researchers state that limiting the attackers’ ability to usefully manipulate instructions also depends on the properties the prover’s function has. The proposed system assumes a specific geometric arrangement: two verifiers positioned around a central prover, with the expectation that the prover resides midway between them.
The verifiers exchange information via a private, authenticated channel, enabling them to coordinate and validate the prover’s responses during the QPV rounds. The protocol’s success hinges on the timely reception of correct measurement results from the prover during these verification rounds; any discrepancies or delays trigger an immediate abort, preventing the establishment of a compromised key.
The researchers anticipate that this analysis can be generalized to encompass a broader range of adversarial strategies. The choice of f is not arbitrary. It must be carefully designed to ensure that the resulting protocol remains secure against potential attacks. The researchers emphasize that the properties of f are critical for preventing attackers from manipulating the communication between the verifiers and the prover. This manipulation could involve tricking the prover into believing a key generation round is a position verification round, thereby causing the leakage of sensitive key material.
The work details a specific implementation of the protocol, outlining the steps taken by the verifiers and the prover in each round. Verifiers randomly select n-bit strings and prepare BB84 states based on a random bit, transmitting these states along with the input strings to the prover.
The prover then computes f on the received inputs, determining the measurement basis and round type. Depending on the outcome, the prover either records the measurement result as key material or sends it back to the verifiers for verification. The timing of these steps is important, as the verifiers must receive the prover’s responses within a limited time window to confirm their location. The researchers highlight the potential for this approach to be particularly useful in scenarios where secure military bases or other sensitive locations require encrypted communication.
In such cases, the ability to verify the physical location of the recipient before decrypting a message adds an extra layer of security, ensuring that only authorized personnel can access the information. The integration of QPV and QKD in this manner presents a unique set of challenges, requiring a careful balance between security and efficiency.
👉 More information
🗞 Authenticating quantum key distribution through random position checks
✍️ Florian J. Curchod, Erik Woodhead and Marcel Mordarski (Quantinuum, Terrington House, 13–15 Hills Road, Cambridge, United Kingdom); Cameron Foreman and Harry Buhrman (Quantinuum, Partnership House, London, United Kingdom)
🧠 ArXiv: https://arxiv.org/abs/2611.26542v1




See today’s quantum computing news on Quantum Zeitgeist for the latest breakthroughs in qubits, hardware, algorithms, and industry deals.
