Related papers: Quantum Finite State Transducers
Recent theoretical results confirm that quantum theory provides the possibility of new ways of performing efficient calculations. The most striking example is the factoring problem. It has recently been shown that computers that exploit…
We investigate quantum phase transitions (QPTs) in spin chain systems characterized by local Hamiltonians with matrix product ground states. We show how to theoretically engineer such QPT points between states with predetermined properties.…
The task of testing whether two uncharacterized quantum devices behave in the same way is crucial for benchmarking near-term quantum computers and quantum simulators, but has so far remained open for continuous-variable quantum systems. In…
We define a new query measure we call quantum distinguishing complexity, denoted QD(f) for a Boolean function f. Unlike a quantum query algorithm, which must output a state close to |0> on a 0-input and a state close to |1> on a 1-input, a…
Perhaps the quantum state represents information about reality, and not reality directly. Wave function collapse is then possibly no more mysterious than a Bayesian update of a probability distribution given new data. We consider models for…
Robust quantum state transfer (QST) is an indispensable ingredient in scalable quantum information processing. Here we present an experimentally feasible mechanism for realizing robust QST via topologically protected edge states in…
Quantum Fourier gates (QFG) constitute a family of quantum gates that result from an exact combination of the quantum Fourier transform (QFT) and the SWAP gate. As a direct consequence of this, the Feynman gate is a particular case of that…
In the literature, there exist several interesting hybrid models of finite automata which have both quantum and classical states. We call them semi-quantum automata. In this paper, we compare the descriptional power of these models with…
Entanglement is a striking feature of quantum mechanics, and it has a key property called unextendibility. In this paper, we present a framework for quantifying and investigating the unextendibility of general bipartite quantum states.…
{\em Quantum Fourier analysis} is a new subject that combines an algebraic Fourier transform (pictorial in the case of subfactor theory) with analytic estimates. This provides interesting tools to investigate phenomena such as quantum…
In high dimensional quantum communication networks, quantum frequency convertor (QFC) is indispensable as an interface in the frequency domain. For example, many QFCs have been built to link atomic memories and fiber channels. However,…
Not all contracts are good, but all good contracts can be expressed as a finite-state transition system ("State-Transition Contracts"). Contracts that can be represented as State-Transition Contracts discretize fat-tailed risk to…
It is often stated that quantum mechanics only makes statistical predictions and that a quantum state is described by the various probability distributions associated with it. Can we describe a quantum state completely in terms of…
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…
Deterministic and nondeterministic finite automata with translucent letters were introduced by Nagy and Otto more than a decade ago as Cooperative Distributed systems of a kind of stateless restarting automata with window size one. These…
Examples are given of q-deformed systems that may be interpreted by the standard rules of quantum theory in terms of new degrees of freedom and supplementary quantum numbers.
An arbitrary quantum-optical process (channel) can be completely characterized by probing it with coherent states using the recently developed coherent-state quantum process tomography (QPT) [Lobino et al., Science 322, 563 (2008)]. In…
The quantum Fourier transform (QFT) plays an important role in many known quantum algorithms such as Shor's algorithm for prime factorisation. In this paper we show that the QFT algorithm can, on a restricted set of input states, be…
In quantum-state tomography on sources with quantum degrees of freedom of large Hilbert spaces, inference of quantum states of light for instance, a complete characterization of the quantum states for these sources is often not feasible…
In this lecture, we survey a number of recent results and developments regarding the representation theory of infinite-dimensional quantum groups (quantum affine algebras and related algebras), as well as their connections with cluster…