Attention to the very physical aspects of information characterizes the current research in quantum computation, quantum cryptography and quantum communication. In most of the cases quantum description of the system provides advantages over the classical approach. Game theory, the study of decision making in conflict situation has already been extended to the quantum domain. We would like to review the latest development in quantum game theory that is relevant to information processing. We will begin by illustrating the general idea of a quantum game and methods of gaining an advantage over
"classical opponent". Then we review the most important game theoretical aspects of quantum information processing. On grounds of the discussed material, we reason about possible future development of quantum game theory and its impact on information processing and the emerging information society. The idea of quantum artificial intelligence is explained.
A programmable quantum networks model is used in this paper for development of methods of control of a quantum state transport. These methods may be applied for a wide variety of patterns of controlled state transmission and spreading in quantum systems. The programmable perfect state transfer and quantum walk, mobile quantum (ro)bots and lattice gas automata may be described by unified way with such approach.
We discuss the problem of designing an unambiguous programmable discriminator for mixed quantum states. We prove that there does not exist such a universal unambiguous programmable discriminator for mixed quantum states that has two program registers and one data register. However, we find that we can use the idea of programmable discriminator to unambiguously discriminate mixed quantum states. The research shows that by using such an idea, when the success probability for discrimination reaches the upper bound, the success probability is better than what we do not use the idea to do, except f…
By combining telecloning and programmable quantum gate array presented by Nielsen and Chuang [Phys.Rev.Lett. 79 :321(1997)], we propose a programmable quantum processor which can be programmed to implement restricted set of operations with several identical data outputs. The outputs are approximately-transformed versions of input data. The processor successes with certain probability.
We discuss the unique capabilities of programmable logic devices (PLD's) for experimental quantum optics and describe basic procedures of design and implementation. Examples of advanced applications include optical metrology and feedback control of quantum dynamical systems. As a tutorial illustration of the PLD implementation process, a field programmable gate array (FPGA) controller is used to stabilize the output of a Fabry-Perot cavity.
We propose a scheme of a programmable quantum motherboard based on the system of three interacting high-Q resonators coupled with two-level atoms. By using the algebraic methods, we found that the investigated atomic-resonator platform can possess an equidistant spectrum of the eigenfrequencies at which simple reversible dynamics of the single photon excitation becomes possible. It was shown that such multiresonator quantum motherboard scheme allows to achieve efficient and programmable quantum state transfer between distributed atoms and generate logical qubits and qutrits. The use of the stu…
A quantum processor to import, process, and export optical quantum states is a common core technology enabling various photonic quantum information processing. However, there has been no photonic processor which is simultaneously universal, scalable, and programmable. Here, we report on an original loop-based single-mode versatile photonic quantum processor which is designed to be universal, scalable, and programmable. Our processor can perform arbitrarily many steps of programmable quantum operations on a given single-mode optical quantum state by time-domain processing in a dynamically contr…
We study possible realizations of generalized quantum measurements on measurement-assisted programmable quantum processors. We focus our attention on the realization of von Neumann measurements and informationally complete POVMs. It is known that two unitary transformations implementable by the same programmable processor require mutually {\it orthogonal} states. It turns out that the situation with von Neumann measurements is different. Specifically, in order to realize two such measurements one does not have to use orthogonal program states. On the other hand, the number of the implementable…
We present the implementation of a programmable atom-photon quantum interface, employing a single trapped $^{40}$Ca$^+$ ion and single photons. Depending on its mode of operation, the interface serves as a bi-directional atom-photon quantum-state converter, as a source of entangled atom-photon states, or as a quantum frequency converter of single photons. The interface lends itself particularly to interfacing ions with single or entangled photons in hybrid quantum networks.
We prove that for a programmable measurement device that approximates every POVM with an error $\le δ$, the dimension of the program space has to grow at least polynomially with $\frac{1}δ$. In the case of qubits we can improve the general result by showing a linear growth. This proves the optimality of the programmable measurement devices recently designed in [G. M. D'Ariano and P. Perinotti, Phys. Rev. Lett. \textbf{94}, 090401 (2005)].
We show how quantum dynamics (a unitary transformation) can be captured in the state of a quantum system, in such a way that the system can be used to perform, at a later time, the stored transformation almost perfectly on some other quantum system. Thus programmable quantum gates for quantum information processing are feasible if some small degree of imperfection is allowed. We discuss the possibility of using this fact for securely computing a secret function on a public quantum computer. Finally, our scheme for storage of operations also allows for a new form of quantum remote control.
This paper presents a scheme for linear-optical implementation of a programmable quantum router. Polarization encoded photon qubit is coherently routed to various spatial modes according to the state of several control qubits. In our implementation, the polarization state of the signal photon does not change under the routing operation. We also discuss generalization of the scheme that would allow to obtain signal dependent routing.
We show how quantum dynamics can be captured in the state of a quantum system, in such a way that the system can be used to stochastically perform, at a later time, the stored transformation perfectly on some other quantum system. Thus programmable quantum gates for quantum information processing are feasible if some probability of failure -that we show to decrease exponentially with the size of the storing resources- is allowed.
We experimentally demonstrate a programmable single-qubit quantum gate. This device applies a unitary phase shift operation to a data qubit with the value of the phase shift being fully determined by the state of a program qubit. Our linear optical implementation is based on the encoding of qubits into polarization states of single photons, two-photon interference on a polarizing beam splitter, and measurement on the output program qubit. We fully characterize the programmable gate by quantum process tomography. The achieved average quantum process fidelity exceeding 97% illustrates very good …
We experimentally demonstrate a programmable quantum gate that applies a sign flip operation to data qubit in an arbitrary basis fully specified by the quantum state of a two-qubit program register. Our linear-optical implementation is inspired by teleportation-based schemes for quantum computing and relies on multiphoton interference and coincidence detection. We confirm the programmability of the gate and its high-fidelity performance by carrying out full quantum process tomography of the resulting operation on data qubit for several different programs.
Even if Google AI's Sycamore processor is efficient for the particular task it has been designed for it fails to deliver universal computational capacity. Furthermore, even classical devices implementing transverse homoclinic orbits realize exponential speedups with respect to universal classical as well as quantum computations. Moreover, relative to the validity of quantum mechanics, there already exist quantum oracles which violate the Church-Turing thesis.
Quantum computers, which take advantage of the superposition and entanglement of physical states, could outperform their classical counterparts in solving problems with technological impact, such as factoring large numbers and searching databases. A quantum processor executes algorithms by applying a programmable sequence of gates to an initialized state of qubits, which coherently evolves into a final state containing the result of the computation. Although quantum processors with a few qubits have been demonstrated on multiple quantum computing platforms, realization of solid-state programma…
We analyze and compare the optimality of approximate and probabilistic universal programmable quantum processors. We define several characteristics how to quantify the optimality and we study in detail performance of three types of programmable quantum processors based on (1) the C-NOT gate, (2) the SWAP operation, and (3) the model of the quantum information distributor - the QID processor. We show under which conditions the measurement assisted QID processor is optimal. We also investigate optimality of the so-called U-processors and we also compare the optimal approximative implementation o…
Constructing general programmable circuits to be able to run any given unitary operator efficiently on a quantum processor is of fundamental importance. We present a new quantum circuit design technique resulting two general programmable circuit schemes. The circuit schemes can be used to simulate any given operator by setting the angle values in the circuit. This provides a fixed circuit design whose angles are determined from the elements of the given matrix, which can be non-unitary, in an efficient way. We also give both classical and quantum complexity analysis for these circuits and show…
Quantum annealing is a general strategy for solving difficult optimization problems with the aid of quantum adiabatic evolution. Both analytical and numerical evidence suggests that under idealized, closed system conditions, quantum annealing can outperform classical thermalization-based algorithms such as simulated annealing. Do engineered quantum annealing devices effectively perform classical thermalization when coupled to a decohering thermal environment? To address this we establish, using superconducting flux qubits with programmable spin-spin couplings, an experimental signature which i…
We discuss the role of classical control in the context of reversible quantum cellular automata. Employing the structure theorem for quantum cellular automata, we give a general construction scheme to turn an arbitrary cellular automaton with external classical control into an autonomous one, thereby proving the computational equivalence of these two models. We use this technique to construct a universally programmable cellular automaton on a one-dimensional lattice with single cell dimension 12.
We propose a model of a programmable quantum processing device realizable with existing nanophotonic technologies and which can be viewed as a basis for new high performance hardware architectures. We present protocols and their physical implementation on the controlled photon transfer for executing basic single-qubit and multi-qubit gates. The possible operation of this quantum computer scheme is analyzed. The physical architecture is then formalized by a mathematical model of the Quantum Processing Unit (QPU), which is used as a basis for the Quantum Programming Framework that makes it possi…
Engineering quantum operations is one of the main abilities we need for developing quantum technologies and designing new fundamental tests. Here we propose a scheme for realising a controlled operation acting on a travelling quantum field, whose functioning is determined by an input qubit. This study introduces new concepts and methods in the interface of continuous- and discrete-variable quantum optical systems.
A universal programmable quantum processor uses program quantum states to apply an arbitrary quantum channel to an input state. We generalize the concept of a finite-dimensional programmable quantum processor to infinite dimension assuming an energy constraint on the input and output of the target quantum channels. By proving reductions to and from finite-dimensional processors, we obtain upper and lower bounds on the program dimension required to approximately implement energy-limited quantum channels. In particular, we consider the implementation of Gaussian channels. Due to their practical …
We show that it is possible to control the trade-off between information gain and disturbance in generalized measurements of qudits by utilizing the programmable quantum processor. This universal quantum machine allows us to perform a generalized measurement on the initial state of the input qudit to construct a Husimi function of this state. The trade-off between the gain and the disturbance of the qudit is controlled by the initial state of ancillary system that acts as a program register for the quantum-information distributor. The trade-off fidelity does not depend on the initial state of …
Processing quantum information using quantum three-level systems or qutrits as the fundamental unit is an alternative to contemporary qubit-based architectures with the potential to provide significant computational advantages. We demonstrate a fully programmable two-qutrit quantum processor by utilizing the third energy eigenstates of two transmons. We develop a parametric coupler to achieve excellent connectivity in the nine-dimensional Hilbert space enabling efficient implementations of two-qutrit gates. We characterize our processor by realizing several algorithms like Deutsch-Jozsa, Berns…
We examine the execution of general U(1) transformations on programmable quantum processors. We show that, with only the minimal assumption of availability of copies of the one-qubit program state, that the apparent advantage of existing schemes proposed by G.Vidal it et al. [Phys. Rev. Lett. 88, 047905 (2002)] and M.Hillery et al. [Phys. Rev. A. 65, 022301 (2003)] to execute a general U(1) transformation with greater probability using complex program states appears not to hold.
A universal programmable detector is a device that can be tuned to perform any desired measurement on a given quantum system, by changing the state of an ancilla. With a finite dimension d for the ancilla only approximate universal programmability is possible, with "size" d=f(1/e) increasing function of the "accuracy" 1/e. In this letter we show that, much better than the exponential size known in the literature, one can achieve polynomial size. An explicit example with linear size is also presented. Finally, we show that for covariant measurements exact programmability is feasible.
We experimentally demonstrate a programmable parametric mode sorter of high-dimensional signals in a composite spatiotemporal Hilbert space through mode-selective quantum frequency up-conversion. As a concrete example and with quantum communication applications in mind, we consider the Laguerre-Gaussian and Hermite-Gaussian modes as the spatial and temporal state basis for the signals, respectively. By modulating the spatiotemporal profiles of the up-conversion pump, we demonstrate the faithful selection of single photons in those modes and their superposition modes. Our results show an improv…
We consider a scheme of quantum teleportation where a receiver has multiple (N) output ports and obtains the teleported state by merely selecting one of the N ports according to the outcome of the sender's measurement. We demonstrate that such teleportation is possible by showing an explicit protocol where N pairs of maximally entangled qubits are employed. The optimal measurement performed by a sender is the square-root measurement, and a perfect teleportation fidelity is asymptotically achieved for a large N limit. Such asymptotic teleportation can be utilized as a universal programmable pro…
We show how to construct quantum gate arrays that can be programmed to perform different unitary operations on a data register, depending on the input to some program register. It is shown that a universal quantum gate array - a gate array which can be programmed to perform any unitary operation - exists only if one allows the gate array to operate in a probabilistic fashion. The universal quantum gate array we construct requires an exponentially smaller number of gates than a classical universal gate array.
We present a systematic analysis how one can improve performance of probabilistic programmable quantum processors. We generalize a simple Vidal-Masanes-Cirac processor that realizes U(1) rotations on a qubit with the phase of the rotation encoded in a state of the program register. We show how the probability of success of the probabilistic processor can be enhanced by using the processor in loops. In addition we show that the same strategy can be utilized for a probabilistic implementation of non-unitary transformations on qubits. In addtion, we show that an arbitrary SU(2) transformations of…
A quantum processor is a programmable quantum circuit in which both the data and the program, which specifies the operation that is carried out on the data, are quantum states. We study the situation in which we want to use such a processor to approximate a set of unitary operators to a specified level of precision. We measure how well an operation is performed by the process fidelity between the desired operation and the operation produced by the processor. We show how to find the program for a given processor that produces the best approximation of a particular unitary operation. We also pla…
Quantum computation has attracted much attention, among other things, due to its potentialities to solve classical NP problems in polynomial time. For this reason, there has been a growing interest to build a quantum computer. One of the basic steps is to implement the quantum circuit able to realize a given unitary operation. This task has been solved using decomposition of unitary matrices in simpler ones till reach quantum circuits having only single-qubits and CNOTs gates. Usually the goal is to find the minimal quantum circuit able to solve a given problem. In this paper we go in a differ…
We present an optical implementation of two programmable quantum measurement devices. The first one serves for unambiguous discrimination of two nonorthogonal states of a qubit. The particular pair of states to be discriminated is specified by the quantum state of a program qubit. The second device can perform von Neumann measurements on a single qubit in any basis located on the equator of the Bloch sphere. Again, the basis is selected by the state of a program qubit. In both cases the data and program qubits are represented by polarization states of photons. The experimental apparatus exploi…
We consider two apparently separated problems: in the first part of the paper we study the concept of a scalable (approximate) programmable quantum gate (SPQG). These are special (approximate) programmable quantum gates, with nice properties that could have implications on the theory of universal computation. Unfortunately, as we prove, such objects do not exist in the domain of usual quantum theory. In the second part the problem of noisy dense coding (and generalizations) is addressed. We observe that the additivity problem for the classical capacity obtained is of apparently greater general…
We discuss the problem of designing unambiguous programmable discriminators for any n unknown quantum states in an m-dimensional Hilbert space. The discriminator is a fixed measurement that has two kinds of input registers: the program registers and the data register. The quantum state in the data register is what users want to identify, which is confirmed to be among the n states in program registers. The task of the discriminator is to tell the users which state stored in the program registers is equivalent to that in the data register. First, we give a necessary and sufficient condition for…
We discuss a possibility to build a programmable quantum measurement device (a "quantum multimeter"). That is, a device that would be able to perform various desired generalized, positive operator value measure (POVM) measurements depending on a quantum state of a "program register". As an example, we present a "universal state discriminator". It serves for the unambiguous discrimination of a pair of known non-orthogonal states (from a certain set). If the two states are changed the apparatus can be switched via the choice of the program register to discriminate the new pair of states unambigu…
A new model of quantum computation is considered, in which the connections between gates are programmed by the state of a quantum register. This new model of computation is shown to be more powerful than the usual quantum computation, e. g. in achieving the programmability of permutations of N different unitary channels with 1 use instead of N uses per channel. For this task, a new elemental resource is needed, the "quantum switch", which can be programmed to switch the order of two channels with a single use of each one.
In this paper a programmable quantum state discriminator is implemented by using nuclear magnetic resonance. We use a two qubit spin-1/2 system, one for the data qubit and one for the ancilla (programme) qubit. This device does the unambiguous (error free) discrimination of pair of states of the data qubit that are symmetrically located about a fixed state. The device is used to discriminate both, linearly polarized states and elliptically polarized states. The maximum probability of the successful discrimination is achieved by suitably preparing the ancilla qubit. It is also shown that, the p…
Growing interest in quantum computing for practical applications has led to a surge in the availability of programmable machines for executing quantum algorithms. Present day photonic quantum computers have been limited either to non-deterministic operation, low photon numbers and rates, or fixed random gate sequences. Here we introduce a full-stack hardware-software system for executing many-photon quantum circuits using integrated nanophotonics: a programmable chip, operating at room temperature and interfaced with a fully automated control system. It enables remote users to execute quantum …
A quantum processor is a device with a data register and a program register. The input to the program register determines the operation, which is a completely positive linear map, that will be performed on the state in the data register. We develop a mathematical description for these devices, and apply it to several different examples of processors. The problem of finding a processor that will be able to implement a given set of mappings is also examined, and it is shown that while it is possible to design a finite processor to realize the phase-damping channel, it is not possible to do so fo…
Universidad Nacional de Córdoba（科尔多瓦国立大学）；CONICET, Instituto de Física Enrique Gaviola (IFEG)（阿根廷国家科学研究委员会，恩里克·加维亚拉物理研究所）；Department of Physics, CUNY - The City College of New York（纽约市立学院物理学系）；CUNY-Graduate Center（纽约市立大学研究生中心）
We consider a device which can be programmed using coherent states of light to approximate a given projective measurement on an input coherent state. We provide and discuss three practical implementations of this programmable projective measurement device with linear optics, involving only balanced beam splitters and single photon threshold detectors. The three schemes optimally approximate any projective measurement onto a program coherent state in a non-destructive fashion. We further extend these to the case where there are no assumptions on the input state. In this setting, we show that ou…
Programmable arrays of hundreds of Rydberg atoms have recently enabled the exploration of remarkable phenomena in many-body quantum physics. In addition, the development of high-fidelity quantum gates are making them promising architectures for the implementation of quantum circuits. We present here \textit{Pulser}, an open-source Python library for programming neutral-atom devices at the pulse level. The low-level nature of Pulser makes it a versatile framework for quantum control both in the digital and analog settings. The library also contains simulation routines for studying and exploring…
An examination of the concept of using classical degrees of freedom to drive the evolution of quantum computers is given. Specifically, when externally generated, coherent states of the electromagnetic field are used to drive transitions within the qubit system, a decoherence results due to the back reaction from the qubits onto the quantum field. We derive an expression for the decoherence rate for two cases, that of the single-qubit Walsh-Hadamard transform, and for an implementation of the controlled-NOT gate. We examine the impact of this decoherence mechanism on Grover's search algorithm,…
In this brief note is discussed application of continuous quantum history ("trash") variable for simplification of scheme of programmable quantum processor. Similar scheme may be tested also in other models of the theory of quantum algorithms and complexity, because provides modification of a standard operation: quantum function evaluation.
