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.
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.
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 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…
The discrimination of any pair of unknown quantum states is performed by devices processing three parts of inputs: copies of the pair of unknown states we want to discriminate are respectively stored in two program systems and copies of data, which is guaranteed to be one of the unknown states, in a third system. We study the efficiency of such programmable devices with the inputs prepared with $n$ and $m$ copies of unknown qubits used as programs and data, respectively. By finding a symmetry in the average inputs, we apply the Jordan basis method to derive their optimal unambiguous discrimina…
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…
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…
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.
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…
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 …
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 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…
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…
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 …
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.
Generative adversarial networks are an emerging technique with wide applications in machine learning, which have achieved dramatic success in a number of challenging tasks including image and video generation. When equipped with quantum processors, their quantum counterparts--called quantum generative adversarial networks (QGANs)--may even exhibit exponential advantages in certain machine learning applications. Here, we report an experimental implementation of a QGAN using a programmable superconducting processor, in which both the generator and the discriminator are parameterized via layers o…
Superconducting circuits are at the forefront of quantum computing technology because of the unparalleled combination of good coherence, fast gates and flexibility in design parameters. The majority of experiments demonstrating small quantum algorithms in the superconducting architecture have used transmon qubits and transverse qubit-qubit coupling. However, efficient universal digital computing has remained a challenge due to the fact that majority of the state-of-art architectures rely on nearest-neighbor coupling in one or two dimensions. The limited connectivity and the availability of onl…
Simulating the topological phases of matter in synthetic quantum simulators is a topic of considerable interest. Given the universality of digital quantum simulators, the prospect of digitally simulating exotic topological phases is greatly enhanced. However, it is still an open question how to realize digital quantum simulation of topological phases of matter. Here, using common single- and two-qubit elementary quantum gates, we propose and demonstrate an approach to design topologically protected quantum circuits on the current generation of noisy quantum processors where spin-orbital coupli…
The universal quantum computer is a device capable of simulating any physical system and represents a major goal for the field of quantum information science. Algorithms performed on such a device are predicted to offer significant gains for some important computational tasks. In the context of quantum information, "universal" refers to the ability to perform arbitrary unitary transformations in the system's computational space. The combination of arbitrary single-quantum-bit (qubit) gates with an entangling two-qubit gate is a gate set capable of achieving universal control of any number of q…
The discrimination between two unknown states can be performed by a universal programmable discriminator, where the copies of the two possible states are stored in two program systems respectively and the copies of data, which we want to confirm, are provided in the data system. In the present paper, we propose a group-theretic approach to the multi-copy programmable state discrimination problem. By equivalence of unknown pure states to known mixed states and with the representation theory of U(n) group, we construct the Jordan basis to derive the analytical results for both the optimal unambi…
Quantum walks are the quantum mechanical analogue of classical random walks and an extremely powerful tool in quantum simulations, quantum search algorithms, and even for universal quantum computing. In our work, we have designed and fabricated an 8x8 two-dimensional square superconducting qubit array composed of 62 functional qubits. We used this device to demonstrate high fidelity single and two particle quantum walks. Furthermore, with the high programmability of the quantum processor, we implemented a Mach-Zehnder interferometer where the quantum walker coherently traverses in two paths be…
Environmental noise and disorder play critical roles in quantum particle and wave transport in complex media, including solid-state and biological systems. Recent work has predicted that coupling between noisy environments and disordered systems, in which coherent transport has been arrested due to localization effects, could actually enhance transport. Photonic integrated circuits are promising platforms for studying such effects, with a central goal being the development of large systems providing low-loss, high-fidelity control over all parameters of the transport problem. Here, we fully ma…
Los Alamos National Laboratory（洛斯阿拉莫斯国家实验室）；IBM Research（IBM 研究院）；QuSoft；Institute for Logic, Language and Computation, University of Amsterdam（阿姆斯特丹大学逻辑、语言与计算研究所）；Korteweg-de Vries Institute for Mathematics, University of Amsterdam（阿姆斯特丹大学科特韦格-德弗里斯数学研究所）
Here is discussed the Hamiltonian approach to construction of deterministic universal (in approximate sense) programmable quantum circuits with qubits or any other quantum systems with dimension of Hilbert space is $n \ge 2$.
This is an updated version of supplementary information to accompany "Quantum supremacy using a programmable superconducting processor", an article published in the October 24, 2019 issue of Nature. The main article is freely available at https://www.nature.com/articles/s41586-019-1666-5. Summary of changes since arXiv:1910.11333v1 (submitted 23 Oct 2019): added URL for qFlex source code; added Erratum section; added Figure S41 comparing statistical and total uncertainty for log and linear XEB; new References [1,65]; miscellaneous updates for clarity and style consistency; miscellaneous typogr…
We describe a class of programmable devices that can discriminate between two quantum states. We consider two cases. In the first, both states are unknown. One copy of each of the unknown states is provided as input, or program, for the two program registers, and the data state, which is guaranteed to be prepared in one of the program states, is fed into the data register of the device. This device will then tell us, in an optimal way, which of the templates stored in the program registers the data state matches. In the second case, we know one of the states while the other is unknown. One cop…
A quantum processor (the programmable gate array) is a quantum network with a fixed structure. A space of states is represented as tensor product of data and program registers. Different unitary operations with the data register correspond to "loaded" programs without any changing or "tuning" of network itself. Due to such property and undesirability of entanglement between program and data registers, universality of quantum processors is subject of rather strong restrictions. By different authors was developed universal "stochastic" quantum gate arrays. It was proved also, that "deterministic…
With qubit measurement and control fidelities above the threshold of fault-tolerance, much attention is moving towards the daunting task of scaling up the number of physical qubits to the large numbers needed for fault tolerant quantum computing. Here, quantum dot based spin qubits may offer significant advantages due to their potential for high densities, all-electrical operation, and integration onto an industrial platform. In this system, the initialisation, readout, single- and two-qubit gates have been demonstrated in various qubit representations. However, as seen with other small scale …
A programmable quantum processor uses the states of a program register to specify one element of a set of quantum channels which is applied to an input register. It is well-known that such a device is impossible with a finite-dimensional program register for any set that contains infinitely many unitary quantum channels (Nielsen and Chuang's No-Programming Theorem), meaning that a universal programmable quantum processor does not exist. The situation changes if the system has symmetries. Indeed, here we consider group-covariant channels. If the group acts irreducibly on the channel input, thes…
In-orbit operation of a programmable quantum photonic processor
University of Vienna（维也纳大学）；QUBO Technology GmbH（QUBO技术有限公司）；Remote Sensing Technology Institute, German Aerospace Center (DLR)（德国航空航天中心遥感技术研究所）；Istituto di Fotonica e Nanotecnologie, Consiglio Nazionale delle Ricerche (IFN-CNR)（国家研究委员会光子学与纳米技术研究所）
Most modern classical processors support so-called von Neumann architecture with program and data registers. In present work is revisited similar approach to models of quantum processors. Deterministic programmable quantum gate arrays are considered as an example. They are also called von Neumann quantum processors here and use conditional quantum dynamics. Such devices have some problems with universality, but consideration of hybrid quantum processors, i.e., models with both continuous and discrete quantum variables resolves the problems. It is also discussed comparison of such a model of qu…
Henan Key Laboratory of Quantum Information and Cryptography（河南省量子信息与密码重点实验室）；University of Science and Technology of China（中国科学技术大学）；Hefei National Research Center for Physical Sciences at the Microscale（合肥微尺度物质科学国家研究中心）；Shanghai Research Center for Quantum Science（上海量子科学研究中心）；CAS Center for Excellence in Quantum Information and Quantum Physics（中国科学院量子信息与量子科技创新研究院）；Hefei National Laboratory（合肥国家实验室）
Training a quantum machine learning model generally requires a large labeled dataset, which incurs high labeling and computational costs. To reduce such costs, a selective training strategy, called active learning (AL), chooses only a subset of the original dataset to learn while maintaining the trained model's performance. Here, we design and implement two AL-enpowered variational quantum classifiers, to investigate the potential applications and effectiveness of AL in quantum machine learning. Firstly, we build a programmable free-space photonic quantum processor, which enables the programme…
Simulating Hamiltonian dynamics in a programmable photonic quantum processor using linear combinations of unitary operations
State Key Laboratory for Mesoscopic Physics, School of Physics, Peking University（北京大学物理学院介观物理国家重点实验室）；Frontiers Science Center for Nano-optoelectronics & Collaborative Innovation Center of Quantum Matter, Peking University（北京大学纳米光子学与光电子前沿科学中心及量子物质协同创新中心）；Collaborative Innovation Center of Extreme Optics, Shanxi University（山西大学极端光学协同创新中心）；Peking University Yangtze Delta Institute of Optoelectronics（北京大学长三角光电科学研究院）；Hefei National Laboratory（合肥国家实验室）
In this paper is presented an abstract theory of quantum processors and controllers, special kind of quantum computational network defined on a composite quantum system with two parts: the controlling and controlled subsystems. Such approach formally differs from consideration of quantum control as some external influence on a system using some set of Hamiltonians or quantum gates. The model of programmed quantum controllers discussed in present paper is based on theory of universal deterministic quantum processors (programmable gate arrays). Such quantum devices may simulate arbitrary evoluti…
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…
High-dimensional entanglement offers a variety of advantages for both fundamental and applied applications in quantum information science. A central building block for such applications is a programmable processor of entangled states, which is crucial for the certification, manipulation and distribution of high-dimensional entanglement. The leading technology for processing photons is integrated multiport interferometers. However, such devices are incompatible with structured light, and their scaling is challenging. Here, we unlock these limitations by demonstrating a reconfigurable processor …
