Random approximate quantum information masking

• URL: http://arxiv.org/abs/2507.19454v1
• Date: Fri, 25 Jul 2025 17:38:30 GMT
• Title: Random approximate quantum information masking
• Authors: Xiaodi Li, Xinyang Shu, Huangjun Zhu,
• Abstract summary: Masking information into quantum correlations is a cornerstone of many quantum information applications.<n>Despite its potential, approximate quantum information masking (AQIM) still remains underexplored.<n>We show that, under certain conditions, approximate quantum error correction is equivalent to AQIM.
• Score: 6.408674550016314
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Masking information into quantum correlations is a cornerstone of many quantum information applications. While there exist the no-hiding and no-masking theorems, approximate quantum information masking (AQIM) offers a promising means of circumventing the constraints. Despite its potential, AQIM still remains underexplored, and constructing explicit approximate maskers remains a challenge. In this work, we investigate AQIM from multiple perspectives and propose using random isometries to construct approximate maskers. First, different notions of AQIM are introduced and we find there are profound intrinsic connections among them. These relationships are characterized by a set of figures of merit, which are introduced to quantify the deviation of AQIM from exact QIM. We then explore the possibility of realizing AQIM via random isometries in bipartite and multipartite systems. In bipartite systems, we identify a fundamental lower bound for a key figure of merit, implying that almost all random isometries fail to realize AQIM. This surprising result generalizes the original no-masking theorem to the no-random-AQIM theorem for bipartite systems. In contrast, in multipartite systems, we show almost all random isometries can realize AQIM. Remarkably, the number of physical qubits required to randomly mask a single logical qubit scales only linearly. We further explore the implications of these findings. In particular, we show that, under certain conditions, approximate quantum error correction is equivalent to AQIM. Consequently, AQIM naturally gives rise to approximate quantum error correction codes with constant code rates and exponentially small correction inaccuracies. Overall, our results establish quantum information masking as a central concept in quantum information theory, bridging diverse notions across multiple domains.

Related papers

• Simultaneous estimations of quantum state and detector through multiple quantum processes [4.782967012381978]
  We introduce a framework, in two different bases, that utilizes multiple quantum processes to simultaneously identify a quantum state and a detector.<n>We prove that the mean squared error (MSE) scales as $O(1/N) $ for both QST and QDT, where $N $ denotes the total number of state copies.
  arXiv  Detail & Related papers  (2025-02-17T13:02:36Z)
• Efficient Quantum Pseudorandomness from Hamiltonian Phase States [41.94295877935867]
  We introduce a quantum hardness assumption called the Hamiltonian Phase State (HPS) problem.<n>We show that our assumption is plausibly fully quantum; meaning, it cannot be used to construct one-way functions.<n>We show that our assumption and its variants allow us to efficiently construct many pseudorandom quantum primitives.
  arXiv  Detail & Related papers  (2024-10-10T16:10:10Z)
• Quantum information scrambling in adiabatically-driven critical systems [49.1574468325115]
  Quantum information scrambling refers to the spread of the initially stored information over many degrees of freedom of a quantum many-body system. Here, we extend the notion of quantum information scrambling to critical quantum many-body systems undergoing an adiabatic evolution.
  arXiv  Detail & Related papers  (2024-08-05T18:00:05Z)
• The Power of Unentangled Quantum Proofs with Non-negative Amplitudes [55.90795112399611]
  We study the power of unentangled quantum proofs with non-negative amplitudes, a class which we denote $textQMA+(2)$. In particular, we design global protocols for small set expansion, unique games, and PCP verification. We show that QMA(2) is equal to $textQMA+(2)$ provided the gap of the latter is a sufficiently large constant.
  arXiv  Detail & Related papers  (2024-02-29T01:35:46Z)
• Analyzing Quantum Programs with LintQ: A Static Analysis Framework for Qiskit [21.351834312054844]
  This paper presents LintQ, a comprehensive static analysis framework for detecting bugs in quantum programs. Our approach is enabled by a set of abstractions designed to reason about common concepts in quantum computing without referring to the underlying quantum computing platform. We apply the approach to a newly collected dataset of 7,568 real-world Qiskit-based quantum programs, showing that LintQ effectively identifies various programming problems.
  arXiv  Detail & Related papers  (2023-10-01T16:36:09Z)
• New Approaches to Complexity via Quantum Graphs [0.0]
  We introduce and study the clique problem for quantum graphs.<n>Our approach utilizes a well-known connection between quantum graphs and quantum channels.<n>We show that, quantified over all channels, this problem is complete for QMA(2).<n>We also give a new proof of the celebrated reduction of QMA(k) to QMA(2).
  arXiv  Detail & Related papers  (2023-09-22T14:20:14Z)
• Tight One-Shot Analysis for Convex Splitting with Applications in Quantum Information Theory [23.18400586573435]
  We establish a one-shot error exponent and a one-shot strong converse for convex splitting with trace distance as an error criterion. This leads to new one-shot exponent results in various tasks such as communication over quantum wiretap channels, secret key distillation, one-way quantum message compression, quantum measurement simulation, and quantum channel coding with side information at the transmitter.
  arXiv  Detail & Related papers  (2023-04-24T12:47:37Z)
• Theory of Quantum Generative Learning Models with Maximum Mean Discrepancy [67.02951777522547]
  We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs) We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution. Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
  arXiv  Detail & Related papers  (2022-05-10T08:05:59Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Quantum Information Masking in Non-Hermitian Systems and Robustness [0.0]
  We show that quantum states can be deterministically masked, while an arbitrary set of quantum states cannot be masked in non-Hermitian quantum systems. We study robustness of quantum information masking against noisy environments.
  arXiv  Detail & Related papers  (2022-03-08T06:03:36Z)
• Single-preparation unsupervised quantum machine learning: concepts and applications [1.7056768055368385]
  We first analyze the connections between all problems, in the classical and quantum frameworks. We then focus on their most challenging versions, involving quantum data and/or quantum processing means. We propose the quite general concept of SIngle-Preparation Quantum Information Processing.
  arXiv  Detail & Related papers  (2021-01-05T10:31:05Z)
• Sampling Overhead Analysis of Quantum Error Mitigation: Uncoded vs. Coded Systems [69.33243249411113]
  We show that Pauli errors incur the lowest sampling overhead among a large class of realistic quantum channels. We conceive a scheme amalgamating QEM with quantum channel coding, and analyse its sampling overhead reduction compared to pure QEM.
  arXiv  Detail & Related papers  (2020-12-15T15:51:27Z)
• Variational Quantum Algorithm for Estimating the Quantum Fisher Information [0.0]
  We present a variational quantum algorithm called Variational Quantum Fisher Information Estimation (VQFIE) By estimating lower and upper bounds on the QFI, based on bounding the fidelity, VQFIE outputs a range in which the actual QFI lies. This result can then be used to variationally prepare the state that maximizes the QFI, for the application of quantum sensing.
  arXiv  Detail & Related papers  (2020-10-20T17:44:55Z)

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.