相关论文: Quantum Weakest Preconditions
Ubiquitous in quantum computing is the step to encode data into a quantum state. This process is called quantum state preparation, and its complexity for non-structured data is exponential on the number of qubits. Several works address this…
Weak measurements of photon position can be used to obtain direct experimental evidence of the wavefunction of a photon between generation and ultimate detection. Significantly, these measurement results can also be understood as complex…
In this paper, we study quantitative properties of quantum programs. Properties of interest include (positive) almost-sure termination, expected runtime or expected cost, that is, for example, the expected number of applications of a given…
Quantum computing has the potential to provide exponential performance benefits in processing over classical computing. It utilizes quantum mechanics phenomena (such as superposition, entanglement, and interference) to solve a computational…
We consider the weak to strong type problem for two weight norm inequalities for Calder\'on-Zygmund operators with doubling weights. We show that if a Calder\'on-Zygmund operator T is weak type (2,2) with doubling weights, then it is strong…
We investigate the computational power of creating steady-states of quantum dissipative systems whose evolution is governed by time-independent and local couplings to a memoryless environment. We show that such a model allows for efficient…
We study the weak values of a quantum observable from the point of view of the Wigner formalism. The main actor is here the cross-Wigner transform of two functions, which is in disguise the cross-ambiguity function familiar from radar…
The logic of definitions is a family of logics for encoding and reasoning about judgments, which are atomic predicates specified by inference rules. A definition associates an atomic predicate with a logical formula, which may itself depend…
Conditional evolution is crucial for generating non-Gaussian resources for quantum information tasks in the continuous variable scenario. However, tools are lacking for a convenient representation of heralded process in terms of quantum…
We introduce the notion of "separation of conditions" meaning that a description of statistical data obtained from experiments, performed under a set of different conditions, allows for a decomposition such that each partial description…
We study weakest precondition reasoning about the (co)variance of outcomes and the variance of run-times of probabilistic programs with conditioning. For outcomes, we show that approximating (co)variances is computationally more difficult…
Quantum programs today are written at a low level of abstraction - quantum circuits akin to assembly languages - and the unitary parts of even advanced quantum programming languages essentially function as circuit description languages.…
While algebraic derivations establish theoretical limits for quantum cloning, practical implementations require explicit operator representations that are often unavailable analytically. We present a computational framework that…
In a predicative framework from basic logic, defined for a model of quantum parallelism by sequents, we characterize a class of first order domains, termed {\em virtual singletons}, which allows a generalization of the notion of duality,…
Characterizing thermally activated transitions in high-dimensional rugged energy surfaces is a very challenging task for classical computers. Here, we develop a quantum annealing scheme to solve this problem. First, the task of finding the…
Using an algebraic framework we solve a problem posed in [5] and [7] about the axiomatizability of a quantum computational type logic related to fuzzy logic. A Hilbert-style calculus is developed obtaining an algebraic strong completeness…
The Quantum Computer Condition (QCC) provides a rigorous and completely general framework for carrying out analyses of questions pertaining to fault-tolerance in quantum computers. In this paper we apply the QCC to the problem of…
A unification of the set of quasiprobability representations using the mathematical theory of frames was recently developed for quantum systems with finite-dimensional Hilbert spaces, in which it was proven that such representations require…
We introduce a general method for the construction of quasiprobability representations for arbitrary notions of quantum coherence. Our technique yields a nonnegative probability distribution for the decomposition of any classical state.…
Entanglement is a non local property of quantum states which has no classical counterpart and plays a decisive role in quantum information theory. Several protocols, like the teleportation, are based on quantum entangled states. Moreover,…