Related papers: On the Relativistic Zero Knowledge Quantum Proofs …
This study proposes a lightweight Zero-Knowledge authentication model supported by QR codes. The approach is based on the Schnorr authentication protocol and provides an additional security layer against replay attacks through nonce and…
The complexity class Quantum Statistical Zero-Knowledge ($\mathsf{QSZK}$), introduced by Watrous (FOCS 2002) and later refined in Watrous (SICOMP, 2009), has the best known upper bound $\mathsf{QIP(2)} \cap \text{co-}\mathsf{QIP(2)}$, which…
In unitary property testing a quantum algorithm, also known as a tester, is given query access to a black-box unitary and has to decide whether it satisfies some property. We propose a new technique for proving lower bounds on the quantum…
Reproduction studies reported in NLP provide individual data points which in combination indicate worryingly low levels of reproducibility in the field. Because each reproduction study reports quantitative conclusions based on its own,…
Universal fault-tolerant quantum computation requires overcoming the Eastin--Knill theorem on quantum error correction (QEC) codes that protect information from noise. This is often accomplished through strategies like magic state…
Quantum systems, in general, output data that cannot be simulated efficiently by a classical computer, and hence is useful for solving certain mathematical problems and simulating quantum many-body systems. This also implies, unfortunately,…
Knowledge graphs (KGs), which could provide essential relational information between entities, have been widely utilized in various knowledge-driven applications. Since the overall human knowledge is innumerable that still grows explosively…
The ability to transfer coherent quantum information between systems is a fundamental component of quantum technologies and leads to coherent correlations within the global quantum process. However correlation structures in quantum channels…
Quantum learning from state samples is often benchmarked in a fixed-budget paradigm, relating error to a prescribed number of copies. We instead adopt a stopping-time viewpoint: in minimal-feedback learning, the learning completion can be…
Zero-knowledge proofs are mathematical cryptographic methods to demonstrate the validity of a claim while providing no further information beyond the claim itself. The possibility of using such proofs to process classified and other…
Proving threshold theorems for fault-tolerant quantum computation is a burdensome endeavor with many moving parts that come together in relatively formulaic but lengthy ways. It is difficult and rare to combine elements from multiple papers…
We explain the quantum structure as due to the presence of two effects, (a) a real change of state of the entity under influence of the measurement and, (b) a lack of knowledge about a deeper deterministic reality of the measurement…
The deployment of large language models (LLMs) faces considerable challenges concerning resource constraints and inference efficiency. Recent research has increasingly focused on smaller, task-specific models enhanced by distilling…
There is a constraining relation between the reliability of a quantum measurement and the extent to which the measurement process is, in principle, reversible. The greater the information that is gained, the less reversible the measurement…
In the e-print is discussed a few steps to introducing of "vocabulary" of relativistic physics in quantum theory of information and computation (QTI&C). The behavior of a few simple quantum systems those are used as models in QTI&C is…
The existence of quantum uncertainty relations is the essential reason that some classically impossible cryptographic primitives become possible when quantum communication is allowed. One direct operational manifestation of these…
As sensor nodes are deployed anywhere in a wireless sensor network, hence their communication can be easily monitored. In these networks, message protection and node identification are very issues. Hence, security of large scale such…
Many seminal results in Interactive Proofs (IPs) use algebraic techniques based on low-degree polynomials, the study of which is pervasive in theoretical computer science. Unfortunately, known methods for endowing such proofs with zero…
The relative entropy is a principal measure of distinguishability in quantum information theory, with its most important property being that it is non-increasing with respect to noisy quantum operations. Here, we establish a remainder term…
Quantum states naturally decay under noise. Many earlier works have quantified and demonstrated lower bounds on the decay rate, showing exponential decay in a wide variety of contexts. Here we study the converse question: are there uniform…