Proofs of quantum memory

• URL: http://arxiv.org/abs/2510.04159v1
• Date: Sun, 05 Oct 2025 11:23:13 GMT
• Title: Proofs of quantum memory
• Authors: Minki Hhan, Tomoyuki Morimae, Yasuaki Okinaka, Takashi Yamakawa,
• Abstract summary: PoQM is an interactive protocol between a classical probabilistic-time verifier and a quantum qu-time.<n>A certain restricted version of PoQM implies quantum classical communication (QCCC) key exchange.
• Score: 12.054720258483096
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: With the rapid advances in quantum computer architectures and the emerging prospect of large-scale quantum memory, it is becoming essential to classically verify that remote devices genuinely allocate the promised quantum memory with specified number of qubits and coherence time. In this paper, we introduce a new concept, proofs of quantum memory (PoQM). A PoQM is an interactive protocol between a classical probabilistic polynomial-time (PPT) verifier and a quantum polynomial-time (QPT) prover over a classical channel where the verifier can verify that the prover has possessed a quantum memory with a certain number of qubits during a specified period of time. PoQM generalize the notion of proofs of quantumness (PoQ) [Brakerski, Christiano, Mahadev, Vazirani, and Vidick, JACM 2021]. Our main contributions are a formal definition of PoQM and its constructions based on hardness of LWE. Specifically, we give two constructions of PoQM. The first is of a four-round and has negligible soundness error under subexponential-hardness of LWE. The second is of a polynomial-round and has inverse-polynomial soundness error under polynomial-hardness of LWE. As a lowerbound of PoQM, we also show that PoQM imply one-way puzzles. Moreover, a certain restricted version of PoQM implies quantum computation classical communication (QCCC) key exchange.

Related papers

• Quantum Interactive Oracle Proofs [2.0482700732041397]
  We introduce the study of quantum Interactive Oracle Proofs (qIOPs)<n>We show two main constructions of qIOPs, both of which are unconditional.<n>We introduce a novel single prover of many-qubits test, which may be of independent interest.
  arXiv  Detail & Related papers  (2026-01-19T09:30:38Z)
• Memory effects in repeated uses of quantum channels [0.0]
  Quantum Information Processing tasks can be efficiently formulated in terms of quantum dynamical maps.<n>A key QIP task is quantum state transfer (QST) aimed at sharing quantum information between distant nodes of a quantum network.<n>We show that even relatively small readout timing errors give rise to memory effects which have a highly detrimental impact on subsequent QST tasks.
  arXiv  Detail & Related papers  (2025-11-07T19:00:14Z)
• On the Cryptographic Foundations of Interactive Quantum Advantage [8.438148845727445]
  hardness required to achieve proofs of quantumness (PoQ)<n>In particular, our results help explain the challenges in using lattices to build publicly verifiable PoQ.
  arXiv  Detail & Related papers  (2025-10-06T17:51:22Z)
• 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)
• Quantum Imitation Learning [74.15588381240795]
  We propose quantum imitation learning (QIL) with a hope to utilize quantum advantage to speed up IL. We develop two QIL algorithms, quantum behavioural cloning (Q-BC) and quantum generative adversarial imitation learning (Q-GAIL) Experiment results demonstrate that both Q-BC and Q-GAIL can achieve comparable performance compared to classical counterparts.
  arXiv  Detail & Related papers  (2023-04-04T12:47:35Z)
• Quantum Merlin-Arthur proof systems for synthesizing quantum states [0.2749898166276853]
  We investigate a state-esizing counterpart of the class NPQP, referred to as stateQMA, which is concerned with preparing certain quantum states.<n>Our main result consists of error reduction of this class and its variants with an exponentially small gap or bounded space.<n>We establish that the family of UQMA witnesses, considered as one of the most natural candidates for stateQMA containments, is in stateQMA.
  arXiv  Detail & Related papers  (2023-03-03T12:14:07Z)
• 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)
• The Min-Entropy of Classical-Quantum Combs for Measurement-Based Applications [0.5999777817331317]
  We formalise multi-round learning processes using a generalisation of classical-quantum states, called classical-quantum combs. We focus attention on an array of problems derived from measurement-based quantum computation (MBQC) and related applications.
  arXiv  Detail & Related papers  (2022-12-01T15:01:19Z)
• Commitments to Quantum States [11.217084610985674]
  A commitment to quantum messages is binding if, after the commit phase, the committed state is hidden from the sender's view. We show that hiding quantum state commitments (QSCs) are implied by any commitment scheme for classical messages. Commitments to quantum states open the door to many new cryptographic possibilities.
  arXiv  Detail & Related papers  (2022-10-11T04:34:36Z)
• 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)
• Quantum Semantic Communications for Resource-Efficient Quantum Networking [52.3355619190963]
  This letter proposes a novel quantum semantic communications (QSC) framework exploiting advancements in quantum machine learning and quantum semantic representations. The proposed framework achieves approximately 50-75% reduction in quantum communication resources needed, while achieving a higher quantum semantic fidelity.
  arXiv  Detail & Related papers  (2022-05-05T03:49:19Z)
• Depth-efficient proofs of quantumness [77.34726150561087]
  A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover. In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
  arXiv  Detail & Related papers  (2021-07-05T17:45:41Z)
• Deep variational quantum eigensolver for excited states and its application to quantum chemistry calculation of periodic materials [0.0]
  Variational Quantum Eigensolver (VQE) is one of the most promising ways to utilize the computational power of quantum devices. We extend the original proposal of Deep VQE to obtain the excited states and apply it to quantum chemistry calculation of a periodic material.
  arXiv  Detail & Related papers  (2021-04-02T02:19:30Z)

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.