相关论文: Quantum Property Testing

Quantum networks play a major role in long-distance communication, quantum cryptography, clock synchronization, and distributed quantum computing. Generally, these protocols involve many independent sources sharing entanglement among…

Large language models (LLMs) are increasingly used in the social sciences to simulate human behavior, based on the assumption that they can generate realistic, human-like text. Yet this assumption remains largely untested. Existing…

To learn quantum mechanics, one must become adept in the use of various mathematical structures that make up the theory; one must also become familiar with some basic laboratory experiments that the theory is designed to explain. The…

This article introduces quantum computation by analogy with probabilistic computation. A basic description of the quantum search algorithm is given by representing the algorithm as a C program in a novel way.

A proof of quantumness is a protocol through which a classical machine can test whether a purportedly quantum device, with comparable time and memory resources, is performing a computation that is impossible for classical computers.…

Property-based random testing a la QuickCheck requires building efficient generators for well-distributed random data satisfying complex logical predicates, but writing these generators can be difficult and error prone. We propose a…

We examine the dependence of quantization on global properties of a classical system. Quantization based on local properties may lead to ambiguities and inconsistency between local and global symmetries of a quantum system. Our quantization…

The usual step-down and step-up multiple testing procedures most often lack an important intuitive, practical, and theoretical property called the interval property. In short, the interval property is simply that for an individual…

The word \textit{proposition} is used in physics with different meanings, which must be distinguished to avoid interpretational problems. We construct two languages $\mathcal{L}^{\ast}(x)$ and $\mathcal{L}(x)$ with classical set-theoretical…

Alongside the development of quantum algorithms and quantum complexity theory in recent years, quantum techniques have also proved instrumental in obtaining results in classical (non-quantum) areas. In this paper we survey these results and…

An improved criterion for distinguishing conditions in which classical or quantum behavior occurs is developed by comparing classical and quantum mechanical measures of size while incorporating spatial and temporal restrictions on wave…

We study the problem of recognizing regular languages in a variant of the streaming model of computation, called the sliding window model. In this model, we are given a size of the sliding window $n$ and a stream of symbols. At each time…

A Bell test separates quantum mechanics from a classical, local realist theory of physics. However, a Bell test cannot separate quantum physics from all classical theories. Classical devices supplemented with non-signaling correlations,…

It is shown that the fault testing for quantum circuits does not follow conventional classical techniques. If probabilistic gate like Hadamard gate is included in a circuit then the classical notion of test vector is shown to fail. We have…

Contrary to the classical case, the relation between quantum programming languages and quantum Turing Machines (QTM) has not being fully investigated. In particular, there are features of QTMs that have not been exploited, a notable example…

This paper studies quantum refereed games, which are quantum interactive proof systems with two competing provers: one that tries to convince the verifier to accept and the other that tries to convince the verifier to reject. We prove that…

Quantum computing is a growing field with significant potential applications. Learning how to code quantum programs means understanding how qubits work and learning to use quantum gates. This is analogous to creating classical algorithms…

Quantum computers promise massive computational speedup for problems in many critical domains, such as physics, chemistry, cryptanalysis, healthcare, etc. However, despite decades of research, they remain far from entering an era of…

Quantum theory is indeterministic, but not completely so. When a system is in a pure state there are properties it possesses with certainty, known as actual properties. The actual properties of a quantum system (in a pure state) fully…

We consider a physical system in which the description of states and measurements follow the usual quantum mechanical rules. We also assume that the dynamics is linear, but may not be fully quantum (i.e unitary). We show that in such a…