相关论文: Nondeterministic Recursion with Quantum Units (I-V…

This is a brief review of the experimental and theoretical quantum computing. The hopes for eventually building a useful quantum computer rely entirely on the so-called "threshold theorem". In turn, this theorem is based on a number of…

With increasing commercial availability of quantum information processing devices the need for testing them efficiently for their specified functionality will arise. Complete quantum channel characterization is out of the question for…

We examine the characteristic features of reversible and quantum computations in the presence of supplementary external information, known as advice. In particular, we present a simple, algebraic characterization of languages recognized by…

We derive a necessary condition for the existence of a completely-positive, linear, trace-preserving map which deterministically transforms one finite set of pure quantum states into another. This condition is also sufficient for…

We consider several applications in black-box quantum computation in which untrusted physical quantum devices are connected together to produce an experiment. By examining the outcome statistics of such an experiment, and comparing them…

A test of quantumness is a protocol where a classical user issues challenges to a quantum device to determine if it exhibits non-classical behavior, under certain cryptographic assumptions. Recent attempts to implement such tests on current…

Application of the noncommutative geometry to several physical models is considered.

An experiment is proposed to test the interference aspect of the Quantum Interference Computer approach

Irreversibility is often considered to characterize measurements in quantum mechanics. Fundamental problems with this characterization are addressed. First, whether a measurement is made in quantum mechanics is an arbitrary decision on the…

Computations with a future quantum computer will be implemented through the operations by elementary quantum gates. It is now well known that the collection of 1-bit and 2-bit quantum gates are universal for quantum computation, i.e., any…

The existence of universal quantum computers has been theoretically well established. However, building up a real quantum computer system not only relies on the theory of universality, but also needs methods to satisfy requirements on other…

We experimentally demonstrate in NMR a quantum interferometric multi-meter for extracting certain properties of unknown quantum states without resource to quantum tomography. It can perform direct state determinations,…

The paper reviews and discusses four ideas scattered in previous papers of the author. First, objective properties of quantum systems are not associated with observables but are defined by preparations. Second, measurable results of…

We present a simple proof of quantum contextuality for a spinless particle with a one dimensional configuration space. We then discuss how the maximally realistic deterministic quantum mechanics recently constructed by this author and V.…

The goal of the presented paper is to provide an introduction to the basic computational models used in quantum information theory. We review various models of quantum Turing machine, quantum circuits and quantum random access machine…

We propose a new wiew on the structure of quantum mechanics and postulate a q-deformed algebra of observables. We find equations of motion for this system, which guarantee a unitary time developement. We solve this equations for simple…

Based on the {\it nonlinear coherent states} method, a general and simple algebraic formalism for the construction of \textit{`$f$-deformed intelligent states'} has been introduced. The structure has the potentiality to apply to systems…

We study non-linear phenomena in quantum dots. Non linearities are reflected in the I-V characteristic curve as bistabilities, instabilities and time dependent oscillations of the currents. The nature of the non-linear behavior depends upon…

Quantum computing is a new model of computation, based on quantum physics. Quantum computers can be exponentially faster than conventional computers for problems such as factoring. Besides full-scale quantum computers, more restricted…

Non-autonomous degenerate KdV systems in (1+1) dimensions are considered for integrability classification. Integrability of the systems is associated with the existence of a recursion operator. Some new non-autonomous degenerate…