A robust verification of the quantum nature of light

Jincheng Zhang

Quantum algorithm verification is a crucial aspect of quantum computing, ensuring the robustness and correctness of quantum computations. Traditional verification methods often rely on static validation schemes, which struggle to adapt to the dynamic nature of quantum algorithms during execution. This paper proposes a novel quantum algorithm validation framework leveraging the concept of adaptive topology, enabling dynamic adjustment of quantum algorithm parameters to enhance verification accuracy and efficiency. We detail the core mechanism, including the design of a validation algorithm that continuously monitors and modifies quantum parameter values based on the algorithm's state. The proposed framework demonstrates improved verification precision and efficiency compared to existing approaches, offering a promising pathway toward robust and scalable quantum verification.

Dennis F. Vanderwerf

Zavatta A., Valentina Parigi, Bellini M.

Martin Bohmann, Luo Qi, Werner Vogel +1 more

The authors present an approach for the detection-device independent verification of nonclassical light. This method applies to any multiplexing system with on-off detectors, and works for both unequal splitting ratios and uncharacterized detectors. The derived nonclassicality conditions yield highly significant verifications of the quantum nature of light from clusters of single-photon emitters, which is detected through time-bin multiplexing.

Alexandru Gheorghiu, Elham Kashefi, Petros Wallden

Recent advances in theoretical and experimental quantum computing bring us closer to scalable quantum computing devices. This makes the need for protocols that verify the correct functionality of quantum operations timely and has led to the field of quantum verification. In this paper we address key challenges to make quantum verification protocols applicable to experimental implementations. We prove the robustness of the single server verifiable universal blind quantum computing protocol of Fitzsimons and Kashefi (2012 arXiv:1203.5217) in the most general scenario. This includes the case where the purification of the deviated input state is in the hands of an adversarial server. The proved robustness property allows the composition of this protocol with a device-independent state tomography protocol that we give, which is based on the rigidity of CHSH games as proposed by Reichardt et al (2013 Nature 496 456–60). The resulting composite protocol has lower round complexity for the verification of entangled quantum servers with a classical verifier and, as we show, can be made fault tolerant.

Daniel F. Walls