Quantum Communication Protocol Verifies Operations Without Full Device Trust

Rajdeep Paul of the Indian Institute of Technology Hyderabad, and colleagues, in collaboration with Korea Institute for Advanced Study detail a new semi-device-independent protocol to verify the accuracy of unitary operations in quantum systems. They present a method for ‘self-testing’ these operations within a prepare-measure framework, utilising a two-qubit quantum state shared between two parties, Alice and Bob, and a variant of a three-bit prepare-measure random access code. This analytical approach demonstrates a quantum advantage over classical communication bounds and offers a generalisable framework applicable to arbitrary n-bit protocols, potentially extending to other prepare-measure communication games, representing a key step towards strong quantum communication networks.

Certification of quantum devices via prepare-measure random access code performance

The optimal quantum success probability in this new variant of the 3-bit prepare-measure random access code (PMRAC) exceeds the classical 5/6 limit, demonstrating a clear quantum advantage. Previously, detailed knowledge of a device’s internal workings was required to certify the accuracy of quantum operations; this self-testing protocol bypasses that need by verifying operations through a communication game between two parties, Alice and Bob. Generalisation to arbitrary n-bit PMRAC protocols is possible, alongside certification of both Alice’s unitary operations and Bob’s measurements, given a shared two-qubit state. Demonstrating a success probability greater than the classical threshold confirms the correct functioning of the quantum components without full characterisation.

A quantum advantage has been demonstrated in a variant of the three-bit prepare-measure random access code (PMRAC), enabling the self-testing of unitary operations. The analytical derivation reveals that the optimal quantum success probability exceeds the classical bound for this communication game, indicating a maximally entangled initial state and unitary operations performed by Alice. This approach potentially extends to other prepare-measure communication games, as well as arbitrary n-bit PMRAC protocols. However, ideal conditions are assumed for these success probabilities, and practical challenges in maintaining quantum coherence or scaling to more complex systems have not yet been addressed.

Advancing quantum verification through device-independent self-testing protocols

Certifying the functionality of quantum devices remains a core challenge in building practical quantum technologies. This new self-testing protocol offers a route to validation without requiring complete knowledge of a device’s inner workings, representing a key step beyond traditional methods reliant on detailed characterisation. While analytically generalisable to arbitrary n-bit prepare-measure random access codes, the authors acknowledge that demonstrating this scalability in practice presents a considerable hurdle.

The importance of this work is not diminished by the remaining challenge of practical demonstration at scale. As quantum computers grow more complex, full internal assessment becomes increasingly difficult and time-consuming, making such a technique essential. Unitary operations, crucial for quantum computation, are certified by this technique using a prepare-measure random access code, a communication method between quantum systems. Establishing a new technique for verifying quantum devices, termed semi-device-independent self-testing, this research confirms the correct operation of quantum components without complete internal knowledge. By employing a variant of the prepare-measure random access code, a quantum communication game where Alice encodes and Bob decodes information, gate fidelity increased five-fold over classical communication limits. This analytical framework isn’t limited to the three-bit system explored here, offering a pathway to generalise the protocol for any number of quantum bits and potentially extending to other communication games.

The field of quantum information science is rapidly advancing, yet the reliable verification of quantum devices remains a significant bottleneck. Traditional methods of characterisation involve painstakingly mapping the internal workings of a quantum system, a process that becomes exponentially more complex with increasing qubit numbers. This new research introduces a semi-device-independent (SDI) self-testing protocol, offering a paradigm shift by focusing on the external behaviour of the device rather than its internal structure. SDI protocols, while not entirely independent of assumptions about the device, minimise these assumptions, providing a more robust certification process. The prepare-measure framework, central to this work, involves Alice preparing a quantum state, applying a unitary operation, and then Bob performing a measurement on the resulting state. This contrasts with circuit-based quantum computation, offering a different approach to quantum information processing.

The specific protocol developed by Paul and colleagues centres around a variant of the 3-bit prepare-measure random access code (PMRAC). In a standard PMRAC, Alice attempts to send one of several possible messages to Bob. The quantum advantage arises from the ability to exploit entanglement and superposition to achieve a success probability exceeding the classical limit of 5/6 for a 3-bit code. The researchers have demonstrated that the optimal quantum success probability for their modified PMRAC surpasses this classical bound, providing concrete evidence of a quantum advantage. This success probability is directly linked to the fidelity of the unitary operations performed by Alice and the accuracy of the measurements performed by Bob. The two-qubit state shared between Alice and Bob is crucial; the protocol relies on the initial state being maximally entangled to achieve optimal performance. Bell states, such as the Φ+ state, are prime candidates for this initial shared entanglement.

The analytical framework developed is not limited to the 3-bit case. The authors demonstrate the generalisability of the protocol to arbitrary n-bit PMRACs. This scalability is a key advantage, as it suggests the potential for building more complex quantum communication networks. Furthermore, the protocol allows for the simultaneous certification of both Alice’s unitary operations and Bob’s measurements. This is achieved by carefully analysing the correlations between Alice’s encoding choices and Bob’s measurement outcomes. The mathematical derivation involves calculating the optimal quantum success probability and comparing it to the classical limit. This requires a detailed understanding of quantum information theory and the properties of unitary transformations. The protocol’s effectiveness hinges on the ability to distinguish between a functioning quantum device and a classical imposter.

While the theoretical results are promising, several practical challenges remain. Maintaining quantum coherence, the delicate state of superposition that underpins quantum computation, is notoriously difficult. Environmental noise and imperfections in the quantum hardware can quickly destroy coherence, leading to errors in the communication game. Scaling the protocol to more complex systems with a larger number of qubits also presents a significant hurdle. Generating and maintaining entanglement between multiple qubits is a demanding task. Furthermore, the efficiency of the protocol depends on the ability to accurately prepare and measure quantum states. Imperfections in these processes can reduce the success probability and compromise the certification process. Future research will need to address these challenges to realise the full potential of this semi-device-independent self-testing protocol. The development of robust error correction techniques and improved quantum hardware will be crucial for translating these theoretical advances into practical applications, ultimately paving the way for secure and reliable quantum communication networks.

This research demonstrated a new method for verifying the correct operation of quantum devices using a prepare-measure random access code involving two parties, Alice and Bob, sharing a two-qubit state. The protocol allows for the self-testing of Alice’s unitary operations and Bob’s measurements, simultaneously confirming their functionality. Researchers showed the approach is scalable to arbitrary n-bit protocols, suggesting potential for more complex quantum communication. The authors intend to address practical challenges such as maintaining quantum coherence and scaling the system to more qubits in future work.