Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 0705.2580

Quantum protocols for transference of proof of zero-knowledge systems

Jose Claudio do Nascimento·Rubens Viana Ramos
View original source ↗Read source document ↗Export metadata ↓

Abstract

Zero-knowledge proof system is an important protocol that can be used as a basic block for construction of other more complex cryptographic protocols. An intrinsic characteristic of a zero-knowledge systems is the assumption that is impossible for the verifier to show to a third part that he has interacted with the prover. However, it has been shown that using quantum correlations the impossibility of transferring proofs can be successfully attacked. In this work we show two new protocols for proof transference, being the first one based on teleportation and the second one without using entangled states.

Explore related subjects

quant-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jose Claudio do Nascimento, Rubens Viana Ramos. 2007-05-17. Quantum protocols for transference of proof of zero-knowledge systems. https://arxiv.org/abs/0705.2580

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Cavity-mediated cross-cross-resonance gate

We propose a cavity-mediated gate between two transmon qubits or other nonlinear superconducting elements. The gate is realized by driving both qubits at a frequency that is near-resonant with the frequency of the cavity. Since both qubits are subject to a cross-resonant drive, we call this gate a cross-cross-resonance gate. In close analogy with gates between trapped-ion qubits, in phase space, the state of the cavity makes a circle whose area depends on the state of the two qubits, realizing a controlled-phase gate. We propose two schemes for canceling the dominant error, which is the qubit-cavity dispersive coupling. We also show that this cross-cross-resonance gate allows one to realize simultaneous gates between multiple pairs of qubits coupled via the same metamaterial composed of an array of coupled cavities or other linear mediators.

quant-ph↗
arXiv2026

Clifford and Haar scramblers yield equal mean fidelity but unequal fluctuations in black hole-inspired teleportation

Quantum information transfer between entangled black holes has inspired many-body teleportation protocols. We study such a protocol without assuming a gravitational dual and ask whether its fidelity requires nonstabilizerness, or magic, in the scrambling dynamics. Because the mean fidelity depends only on the third moments of the scrambler ensemble, zero-magic Clifford scramblers teleport on average as well as Haar-random unitaries. Solving the protocol exactly at infinite temperature, we find that typical Clifford scramblers approach perfect teleportation while the magic of the complete circuit vanishes as the inverse system size. The two ensembles nevertheless differ in their fluctuations: the exact Clifford fidelity variance decays only algebraically with system size, whereas the Haar variance is exponentially small. This separation characterizes the ensembles rather than magic itself, since magic added away from the message qubit can leave every fidelity statistic unchanged. With a decoder uncorrelated with the scrambler, every unitary 2-design leaves the mean fidelity at the no-transfer value, whatever its magic.

quant-ph↗
arXiv2026

An Information-Theoretic Principle for Optimal Quantum Encoding: Tight Frames and Equiangular Ensembles

Optimal encoding of classical data for quantum-assisted statistical inference is investigated from an information-theoretic perspective. We prove that the accuracy of any quantum-computing inference procedure is upper bounded by the maximal quantum leakage from the classical data through its quantum encoding, establishing leakage as a universal, task-agnostic quality measure for encoders. The optimal encoding strategy, i.e., an encoding strategy that maximizes the maximal quantum leakage, is proved to be attained by pure states. When there are enough qubits, basis encoding is proved to be universally optimal. However, when the dimension of the system is small, phase encoding is optimal. For the latter, the optimal encoding is not unique. That is, any tight frame, any ensemble whose average state is the maximally mixed state, is in fact optimal. Within tight frames, equiangular tight frames (ETFs) are distinguished as the uniquely symmetric optimal encodings, i.e., they saturate the Welch lower bound on pairwise overlaps. Prominent special cases are the qubit trine, the regular simplex, and symmetric informationally complete positive operator-valued measures (SIC-POVMs), for which the ETF structure and explicit codeword constructions are provided. Numerical examples are presented to validate the theoretical predictions.

quant-ph↗