Related papers: Reversible computation as a model for the quantum …
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…
Debugging quantum states transformations is an important task of modern quantum computing. The use of quantum tomography for these purposes significantly expands the range of possibilities. However, the presence of preparation and…
Quantum random sampling is the leading proposal for demonstrating a computational advantage of quantum computers over classical computers. Recently, first large-scale implementations of quantum random sampling have arguably surpassed the…
Deterministic synchronous systems consisting of two finite automata running in opposite directions on a shared read-only input are studied with respect to their ability to perform reversible computations, which means that the automata are…
A two-dimensional quantum system with anyonic excitations can be considered as a quantum computer. Unitary transformations can be performed by moving the excitations around each other. Measurements can be performed by joining excitations in…
Measurement of a quantum system provides information concerning the state in which it was prepared. In this paper we show how the retrodictive formalism can be used to evaluate the probability associated with any one of a given set of…
Quantum metrology involves the application of quantum resources to enhance measurements. Several communities have developed quantum-metrology strategies that leverage effective time reversals. These strategies, we posit, form four classes.…
We review progress towards direct simulation of quantum dynamics in many-body systems, using recently developed stochastic gauge techniques. We consider master equations, canonical ensemble calculations and reversible quantum dynamics are…
A Bayesian approach is developed to determine quantum mechanical potentials from empirical data. Bayesian methods, combining empirical measurements and "a priori" information, provide flexible tools for such empirical learning problems. The…
In this paper, a methodical approach to evaluate the potential of quantum computing for manufacturing simulation, using the example of multi-axis milling of thin-walled aerospace components, is discussed. A developed approach for…
In the reductionistic approach, mechanisms are divided into simpler parts interconnected in some standard way (e.g. by a mechanical transmission). We explore the possibility of porting reductionism in quantum operations. Conceptually, first…
We present five examples where quantum finite automata (QFAs) outperform their classical counterparts. This may be useful as a relatively simple technique to introduce quantum computation concepts to computer scientists. We also describe a…
New status in quantum mechanics is connected with recent achievements in the inverse problem. With its help instead of about ten exactly solvable models which serve as a basis of the contemporary education there are infinite (!) number,…
This review gives a survey of numerical algorithms and software to simulate quantum computers.It covers the basic concepts of quantum computation and quantum algorithms and includes a few examples that illustrate the use of simulation…
In a reversible language, any forward computation can be undone by a finite sequence of backward steps. Reversible computing has been studied in the context of different programming languages and formalisms, where it has been used for…
This article gives an overview and a perspective of recent theoretical proposals and their experimental implementations in the field of quantum machine learning. Without an aim to being exhaustive, the article reviews specific high-impact…
Processes such as quantum computation, or the evolution of quantum cellular automata are typically described by a unitary operation implemented by an external observer. In particular, an interaction is generally turned on for a precise…
In this dissertation, we explore how quantum annealing (QA) and its applications behave in an open system setting. We give derivations and numerical recipes for effective parallel simulation methods for time-dependent open dynamics of…
Tensor universality often implies that multi-partite quantum-state processing is determined by what happens in totally disentangled cases. In independent systems relative time direction for the parts is arbitrary. This hints that time may…
We introduce a scheme to perform universal quantum computation in quantum cellular automata (QCA) fashion in arbitrary subsystem dimension (not necessarily finite). The scheme is developed over a one spatial dimension $N$-element array,…