Exact identification of unknown unitary processes
- URL: http://arxiv.org/abs/2605.04981v1
- Date: Wed, 06 May 2026 14:34:14 GMT
- Title: Exact identification of unknown unitary processes
- Abstract summary: We use representation-theoretic tools to study the zero-error protocol for identifying faulty devices.<n>We derive the optimal success probability for the single- and two-anomaly scenarios.<n>We extend our analysis to the general scenario in which both the number of anomalies and the local dimension of the systems are arbitrary.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: The accurate identification of faulty hardware is a fundamental requirement for reliable quantum information processing. We address this problem in a quantum setting, where a series of $n$ devices is intended to apply the same unitary operation, but $k$ malfunctioning devices among them apply a different, unknown unitary action. Under the assumption of complete ignorance regarding the specific unitary transformation applied, we model our hypotheses using representation-theoretic tools and study the zero-error protocol for identifying these faulty devices. We derive the optimal success probability for the single- and two-anomaly scenarios, demonstrating that it is independent of the total number of devices in the series. Furthermore, we present a simple protocol that makes use of ancillary systems that achieves this optimal limit. Notably, this protocol offers significant operational advantages, such as allowing us to test each device independently. Finally, we extend our analysis to the general scenario in which both the number of anomalies and the local dimension of the systems are arbitrary, evaluating our protocol's performance and conjecturing its global optimality in the general case.
Related papers
- Maximal global device-independent randomness from projective measurements in every dimension [1.1419092834574525]
Device-independent random number generation (DIQRNG) is the most secure form of generating private randomness using quantum physical processes.<n>We provide explicit protocols reaching $2log(d)$ bits based on mutually unbiased bases.
arXiv Detail & Related papers (2026-06-19T12:20:41Z) - Device-independent secure correlations in sequential quantum scenarios [44.99833362998488]
Device-independent quantum information is attracting significant attention, particularly for its applications in information security.<n>We propose a systematic approach to designing sequential quantum protocols for device-independent security.<n>We analytically prove that, with this systematic construction, the resulting ideal correlations are secure in the sense that they cannot be reproduced as a statistical mixture of other correlations.
arXiv Detail & Related papers (2025-03-18T16:45:20Z) - 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) - Entropy Accumulation under Post-Quantum Cryptographic Assumptions [4.416484585765028]
In device-independent (DI) quantum protocols, the security statements are oblivious to the characterization of the quantum apparatus.
We present a flexible framework for proving the security of such protocols by utilizing a combination of tools from quantum information theory.
arXiv Detail & Related papers (2023-07-02T12:52:54Z) - Correcting for finite statistics effects in a quantum steering experiment [33.013102271622614]
We introduce a one-sided device-independent protocol that corrects for apparent signaling effects in experimental probability distributions.<n>Our results show a significantly higher probability of violation than existing state-of-the-art inequalities.<n>This work demonstrates the power of semidefinite programming for entanglement verification and brings quantum networks closer to practical applications.
arXiv Detail & Related papers (2023-05-23T14:39:08Z) - Task-Oriented Sensing, Computation, and Communication Integration for
Multi-Device Edge AI [108.08079323459822]
This paper studies a new multi-intelligent edge artificial-latency (AI) system, which jointly exploits the AI model split inference and integrated sensing and communication (ISAC)
We measure the inference accuracy by adopting an approximate but tractable metric, namely discriminant gain.
arXiv Detail & Related papers (2022-07-03T06:57:07Z) - Dynamical learning of a photonics quantum-state engineering process [48.7576911714538]
Experimentally engineering high-dimensional quantum states is a crucial task for several quantum information protocols.
We implement an automated adaptive optimization protocol to engineer photonic Orbital Angular Momentum (OAM) states.
This approach represents a powerful tool for automated optimizations of noisy experimental tasks for quantum information protocols and technologies.
arXiv Detail & Related papers (2022-01-14T19:24:31Z) - Measuring NISQ Gate-Based Qubit Stability Using a 1+1 Field Theory and
Cycle Benchmarking [50.8020641352841]
We study coherent errors on a quantum hardware platform using a transverse field Ising model Hamiltonian as a sample user application.
We identify inter-day and intra-day qubit calibration drift and the impacts of quantum circuit placement on groups of qubits in different physical locations on the processor.
This paper also discusses how these measurements can provide a better understanding of these types of errors and how they may improve efforts to validate the accuracy of quantum computations.
arXiv Detail & Related papers (2022-01-08T23:12:55Z) - 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) - Efficient and robust certification of genuine multipartite entanglement
in noisy quantum error correction circuits [58.720142291102135]
We introduce a conditional witnessing technique to certify genuine multipartite entanglement (GME)
We prove that the detection of entanglement in a linear number of bipartitions by a number of measurements scales linearly, suffices to certify GME.
We apply our method to the noisy readout of stabilizer operators of the distance-three topological color code and its flag-based fault-tolerant version.
arXiv Detail & Related papers (2020-10-06T18:00:07Z) - Certified Randomness From Steering Using Sequential Measurements [0.0]
A single entangled two-qubit pure state can be used to produce arbitrary amounts of certified randomness.
Motivated by these difficulties in the device-independent setting, we consider the scenario of one-sided device independence.
We show how certain aspects of previous work can be adapted to this scenario and provide theoretical bounds on the amount of randomness which can be certified.
arXiv Detail & Related papers (2020-08-03T08:18:29Z) - Identification of malfunctioning quantum devices [0.0]
We consider the problem of correctly identifying a malfunctioning quantum device that forms part of a network of $N$ such devices.
We show that the optimal probability of successful identification requires a global quantum measurement.
arXiv Detail & Related papers (2018-08-08T11:39:50Z)
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.