Researchers have achieved a significant advance in securing delegated quantum computing by demonstrating a method to verify computations using only trusted gates, bypassing a key limitation of previous protocols. Existing information-theoretically Secure Delegated Quantum Computing (SDQC) protocols previously demanded clients possess either trusted state preparations or measurements; this work removes that requirement, addressing a long-standing open question concerning whether universal quantum computations could be verified without trusted preparations or measurements. The team, comprised of Elham Kashefi of the School of Informatics, University of Edinburgh, Dominik Leichtle of Laboratoire d’Informatique de Paris 6, CNRS, Sorbonne Université, Luka Music of Quandela, and Harold Ollivier of DI-ENS, Ecole Normale Supérieure presents a modular, composable, and efficient way to adapt existing verification schemes. Their first contribution is a lightweight reduction of the problem of quantum verification to the trusted application of single-qubit rotations around the Z axis and bit flips. The second construction presented in this work shows that it is generally possible to information-theoretically verify arbitrary quantum computations with quantum output without trusted preparations or measurements, though this requires a multi-qubit register on the verifier’s side, independent of the computation’s size. This breakthrough enables verification of arbitrary quantum computations with quantum output without relying on trusted preparations or measurements, potentially streamlining future quantum delegation services.
Quantum Verification Challenge in Delegated Computing
This development addresses a long-standing open question; researchers have demonstrated a method to verify in the affirmative whether universal quantum computations could be verified without trusted preparations or measurements. This isn’t merely theoretical; the researchers have created a practical pathway to enhance current protocols. Their first contribution is a lightweight reduction of the problem of quantum verification to the trusted application of single-qubit rotations around the Z axis and bit flips, minimizing the demands on client hardware. The second construction presented in this work shows that it is generally possible to information-theoretically verify arbitrary quantum computations with quantum output without trusted preparations or measurements, though this requires a multi-qubit register on the verifier’s side, independent of the size of the delegated computation.
Crucially, the team’s construction ensures no information about the secretly prepared state leaks to the server, while also preventing the server from influencing the state’s production based on classical descriptions. The authors explain that this is done without degrading the cryptographic guarantees provided by the protocols or drastically increasing the requirements on the server’s side, in terms of time or computation overhead, suggesting a viable path toward more secure and accessible delegated quantum computing services.
Reduction to Trusted Single-Qubit Rotations
Current approaches to verifying quantum computations performed by remote servers typically demand clients possess either the ability to reliably prepare quantum states or accurately measure them, a significant limitation for widespread adoption. Recent work from Elham Kashefi of the School of Informatics, University of Edinburgh, Dominik Leichtle of Laboratoire d’Informatique de Paris 6, CNRS, Sorbonne Université, Luka Music of Quandela, and Harold Ollivier of DI-ENS, Ecole Normale Supérieure has bypassed this requirement, demonstrating a pathway to information-theoretic security relying solely on trusted quantum gates. This resolves a longstanding open question concerning whether universal quantum computations could be verified without trusted preparations or measurements. This reduction to trusted single-qubit operations dramatically simplifies the client-side hardware requirements, potentially enabling verification with less expensive and more readily available technology.
The second construction presented in this work shows that it is generally possible to information-theoretically verify arbitrary quantum computations with quantum output without trusted preparations or measurements, though this requires a multi-qubit register on the verifier’s side, independent of the computation’s size. Ultimately, this work represents a significant step toward practical, secure delegated quantum computing, reducing reliance on complex client-side infrastructure and bolstering trust in remote quantum services.
Information-Theoretic Verification with Quantum Output
Researchers are increasingly focused on ensuring the integrity of computations performed on emerging quantum hardware, and Elham Kashefi of the School of Informatics, University of Edinburgh, Dominik Leichtle of Laboratoire d’Informatique de Paris 6, CNRS, Sorbonne Université, Luka Music of Quandela, and Harold Ollivier of DI-ENS, Ecole Normale Supérieure have addressed a critical challenge in this field. Their work tackles the problem of verifying quantum computations without requiring clients to possess fully trusted quantum state preparation or measurement capabilities, a significant limitation of previous Secure Delegated Quantum Computing (SDQC) protocols. Previously, SDQC protocols demanded either trusted state preparations or measurements from the client; this team addresses a longstanding open question concerning whether universal quantum computations could be verified without trusted preparations or measurements in the affirmative. The second construction presented in this work shows that it is generally possible to information-theoretically verify arbitrary quantum computations with quantum output without trusted preparations or measurements. However, this second protocol requires the verifier to perform multi-qubit gates on a register whose size is independent of the size of the delegated computation. This advancement promises to lower the barrier to entry for clients seeking to leverage quantum computing as a service, as conventional wisdom suggests that robust verification of quantum computations demands either impeccably prepared quantum states or precise measurements originating from the client.
This modularity suggests potential for broad implementation across diverse quantum architectures and protocols. The team achieved this reduction, which is crucial because it significantly lowers the complexity of the client’s required quantum hardware.
Classical Cryptography vs. Quantum Client Trust
The landscape of secure quantum computation is rapidly evolving, shifting focus from purely hardware-based solutions to innovative approaches that minimize trust assumptions on the client side. Elham Kashefi of the School of Informatics, University of Edinburgh, Dominik Leichtle of Laboratoire d’Informatique de Paris 6, CNRS, Sorbonne Université, Luka Music of Quandela, and Harold Ollivier of DI-ENS, Ecole Normale Supérieure, recently addressed a longstanding open question concerning whether universal quantum computations could be verified without trusted preparations or measurements, a challenge that previously lacked a definitive answer. In this paper, they settle this question in the affirmative. Their first contribution is a lightweight reduction of the problem of quantum verification to the trusted application of single-qubit rotations around the Z axis and bit flips. They demonstrate that arbitrary quantum computations with quantum output can be verified information-theoretically, though this requires a multi-qubit register on the verifier’s side, independent of the computation’s size. Researchers at Quandela are co-authors of this work.
Single-Photon Sources & Detectors in Verification
Researchers at Quandela are refining quantum verification protocols. Existing SDQC methods traditionally demand clients possess either trustworthy state preparation capabilities or measurement tools; however, Elham Kashefi of the School of Informatics, University of Edinburgh, Dominik Leichtle of Laboratoire d’Informatique de Paris 6, CNRS, Sorbonne Université, Luka Music of Quandela, and Harold Ollivier of DI-ENS, Ecole Normale Supérieure have demonstrated a pathway to bypass this requirement. This resolves a longstanding open question concerning whether universal quantum computations could be verified without trusted preparations or measurements, a challenge that was an open question so far, and this paper settles it in the affirmative. Their first contribution is a lightweight reduction of the problem of quantum verification. The second construction presented in this work shows that it is generally possible to information-theoretically verify arbitrary quantum computations with quantum output without trusted preparations or measurements, though this requires a multi-qubit register on the verifier’s side, independent of the computation’s size. The team’s findings suggest a future where clients can verify computations with minimal reliance on specialized equipment.
The researchers explain that their focus is on minimizing the assumptions required of clients, acknowledging that in any practically relevant settings, clients will need to make some assumptions if they want to verify their delegated computation. By shifting the burden of trust from complex client-side hardware to trusted gates, this advancement promises to make secure delegated computation more accessible and practical for a wider range of applications, potentially accelerating the adoption of quantum technologies.
Source: https://arxiv.org/pdf/2403.10464
