Any gate of a quantum computer can be certified device-independently

• URL: http://arxiv.org/abs/2508.20185v1
• Date: Wed, 27 Aug 2025 18:04:27 GMT
• Title: Any gate of a quantum computer can be certified device-independently
• Authors: Shubhayan Sarkar,
• Abstract summary: Device-independent (DI) certification allows verification of quantum systems based solely on observed statistics.<n>We show in a proof-of-principle way that any quantum unitary can be self-tested within the DI paradigm.
• Score: 0.1624454100511275
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Device-independent (DI) certification allows the verification of quantum systems based solely on observed statistics, without assumptions about their internal structure. While self-testing, the strongest DI certification, of a wide range of quantum states and measurements is done, the self-testing of quantum operations remains underdeveloped. Here, we show in a proof-of-principle way that any quantum unitary can be self-tested within the DI paradigm. For our purpose, we utilise the framework of quantum networks with multiple independent sources. Our work provides a fundamental step toward certifying quantum interactions directly from data, without detailed modelling assumptions. Moreover, the result also serves as a crucial ingredient for quantum computation, where verifying that quantum gates perform as intended is essential for building secure and reliable quantum processors.

Related papers

• Device-independent quantum memory certification in two-point measurement experiments [0.0]
  We present a device-independent approach for certifying black-box quantum memories.<n>We do so by probing quantum systems at two points in time and then confronting the observed temporal correlations against classical causal models.<n>Our method establishes temporal correlations and causal modelling as practical and powerful tool for benchmarking key ingredients of quantum technologies.
  arXiv  Detail & Related papers  (2026-01-20T17:49:54Z)
• Composable framework for device-independent state certification [0.38233569758620045]
  Certifying a quantum state in a device independent (DI) manner is a fundamental task bearing various applications in quantum information theory.<n>We present a composable certification of quantum states in a DI manner under the assumption that a source prepares a finite sequence of independent quantum states that are not necessarily identical.
  arXiv  Detail & Related papers  (2025-05-11T04:05:10Z)
• Sound certification of memory-bounded quantum computers [0.1874930567916036]
  We introduce an approach, which we call quantum system quizzing, for the certification of quantum gates in a practical server-user scenario.<n> Importantly, this approach does not require trusted state preparation and measurement and is thus inherently free from the associated systematic errors.<n>A major technical challenge that we are first to resolve in the memory-bounded single-device setup is recovering the tensor product structure of a multi-qubit system.
  arXiv  Detail & Related papers  (2024-11-06T19:23:45Z)
• Guarantees on the structure of experimental quantum networks [105.13377158844727]
  Quantum networks connect and supply a large number of nodes with multi-party quantum resources for secure communication, networked quantum computing and distributed sensing. As these networks grow in size, certification tools will be required to answer questions regarding their properties. We demonstrate a general method to guarantee that certain correlations cannot be generated in a given quantum network.
  arXiv  Detail & Related papers  (2024-03-04T19:00:00Z)
• Classical certification of quantum gates under the dimension assumption [0.1874930567916036]
  We introduce a certification method for quantum gates tailored for a practical server-user scenario.<n>For single-qubit gates, including those that form a universal set for single-qubit quantum computation, we demonstrate that our approach offers soundness guarantees.
  arXiv  Detail & Related papers  (2024-01-30T13:40:39Z)
• Classical Verification of Quantum Learning [42.362388367152256]
  We develop a framework for classical verification of quantum learning. We propose a new quantum data access model that we call "mixture-of-superpositions" quantum examples. Our results demonstrate that the potential power of quantum data for learning tasks, while not unlimited, can be utilized by classical agents.
  arXiv  Detail & Related papers  (2023-06-08T00:31:27Z)
• Towards the device-independent certification of a quantum memory [0.0]
  We develop efficient certification methods for quantum memories. Considering a device-independent approach, we develop a robust self-testing method for quantum memories. More generally, our methods apply for the characterisation of any device implementing a qubit identity quantum channel.
  arXiv  Detail & Related papers  (2023-04-20T15:46:40Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
  We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources. The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
  arXiv  Detail & Related papers  (2022-09-16T02:37:32Z)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• Quantum Federated Learning with Quantum Data [87.49715898878858]
  Quantum machine learning (QML) has emerged as a promising field that leans on the developments in quantum computing to explore large complex machine learning problems. This paper proposes the first fully quantum federated learning framework that can operate over quantum data and, thus, share the learning of quantum circuit parameters in a decentralized manner.
  arXiv  Detail & Related papers  (2021-05-30T12:19:27Z)
• Sample-efficient device-independent quantum state verification and certification [68.8204255655161]
  Authentication of quantum sources is a crucial task in building reliable and efficient protocols for quantum-information processing. We develop a systematic approach to device-independent verification of quantum states free of IID assumptions in the finite copy regime. We show that device-independent verification can be performed with optimal sample efficiency.
  arXiv  Detail & Related papers  (2021-05-12T17:48:04Z)
• Self-testing of a single quantum device under computational assumptions [7.716156977428555]
  Self-testing is a method to characterise an arbitrary quantum system based only on its classical input-output correlations. We replace the setting of multiple non-communicating parties, which is difficult to enforce in practice, by a single computationally bounded party.
  arXiv  Detail & Related papers  (2020-01-24T19:00:15Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.