We have proposed and demonstrated a scalable and efficient scheme for programmable unitary operations in orbital angular momentum (OAM) domain. Based on matrix decomposition into diagonal and Fourier factors, arbitrary matrix operators can be implemented only by diagonal matrices alternately acting on orbital angular momentum domain and azimuthal angle domain, which are linked by Fourier transform. With numerical simulations, unitary matrices with dimensionality of 3*3 are designed and discussed for OAM domain. Meanwhile, the parallelism of our proposed scheme is also presented with two 3*3 matrices. Furthermore, as an alternative to verify our proposal, proof of principle experiments have been performed on path domain with the same matrix decomposition method, in which an average fidelity of 0.97 is evaluated through 80 experimental results with dimensionality of 3*3.
Free space propagation and conventional optical systems such as lenses and mirrors all perform spatial unitary transforms. However, the subset of transforms available through these conventional systems is limited in scope. We present here a unitary programmable mode converter (UPMC) capable of performing any spatial unitary transform of the light field. It is based on a succession of reflections on programmable deformable mirrors and free space propagation. We first show theoretically that a UPMC without limitations on resources can perform perfectly any transform. We then build an experimenta…
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…
The decomposition of large unitary matrices into smaller ones is important, because it provides ways to realization of classical and quantum information processing schemes. Today, most of the methods use planar meshes of tunable two-channel blocks, however, the schemes turn out to be sensitive to fabrication errors. We study a novel decomposition method based on multi-channel blocks. We have shown that the scheme is universal even when the block`s transfer matrices are chosen at random, making it virtually insensitive to errors. Moreover, the placement of the variable elements can be arbitrary…
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.
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…
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.
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…
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（合肥国家实验室）
Unlike fixed designs, programmable circuit designs support an infinite number of operators. The functionality of a programmable circuit can be altered by simply changing the angle values of the rotation gates in the circuit. Here, we present a new quantum circuit design technique resulting in 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 …
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.
A fundamental question in the theory of quantum computation is to understand the ultimate space-time resource costs for performing a universal set of logical quantum gates to arbitrary precision. Here we demonstrate that non-Abelian anyons in Turaev-Viro quantum error correcting codes can be moved over a distance of order the code distance, and thus braided, by a constant depth local unitary quantum circuit followed by a permutation of qubits. Our gates are protected in the sense that the length of error strings do not grow by more than a constant factor. When applied to the Fibonacci code, ou…
Interferometric Readout of Momentum-Space Topology in a Programmable Dissipative Photonic Circuit
KTH Royal Institute of Technology（皇家理工学院）；Stockholm University（斯德哥尔摩大学）；Singapore University of Technology and Design（新加坡科技设计大学）；Huazhong University of Science and Technology（华中科技大学）
We propose a quantum error correction without error detection. A quantum state $ρ_0$ combined with an ancilla state $σ$ is encoded unitarily and an error operator is applied on the encoded state. The recovery operation then produces a tensor product state $ρ_0 \otimes σ'$. The decoding operation is combined with the recovery operation and the state $ρ_0$ is directly reproduced without referring to the code word. A higher rank projection operator required for a conventional operator quantum error correction is not necessary to implement. Encoding and the recovery operations are implemented with…
The implementation of a quantum computer requires the realization of a large number of N-qubit unitary operations which represent the possible oracles or which are part of the quantum algorithm. Until now there are no standard ways to uniformly generate whole classes of N-qubit gates. We have developed a method to generate arbitrary controlled phase shift operations with a single network of one-qubit and two-qubit operations. This kind of network can be adapted to various physical implementations of quantum computing and is suitable to realize the Deutsch-Jozsa algorithm as well as Grover's se…
Unitary transformations are the fundamental building blocks of gates and operations in quantum information processing allowing the complete manipulation of quantum systems in a coherent manner. In the case of photons, optical elements that can perform unitary transformations are readily available only for some degrees of freedom, e.g. wave plates for polarisation. However for high-dimensional states encoded in the transverse spatial modes of light, performing arbitrary unitary transformations remains a challenging task for both theoretical proposals and actual implementations. Following the id…
We show for the first time how deterministic unitary operations on time-bin qubits encoded in single photon pulses can be realized using fiber optics components that are available with current technology. We also generalize this result to operations on time-bin qudits, i.e. $d$-level systems, and show that this can be done efficiently using 2$\times$2 beamsplitters and phase modulators. Important benefits for experimental quantum communication are highlighted. This work shows how to bridge the gap between current proof-of-principle demonstrations and complete, deterministic experiments.
Isometry operations encode the quantum information of the input system to a larger output system, while the corresponding decoding operation would be an inverse operation of the encoding isometry operation. Given an encoding operation as a black box from a $d$-dimensional system to a $D$-dimensional system, we propose a universal protocol for isometry inversion that constructs a decoder from multiple calls of the encoding operation. This is a probabilistic but exact protocol whose success probability is independent of $D$. For a qubit ($d=2$) encoded in $n$ qubits, our protocol achieves an exp…
We propose two experimental schemes to implement arbitrary unitary single qubit operations on single photons encoded in time-bin qubits. Both schemes require fiber optics components that are available with current technology.
The large available Hilbert space and high coherence of cavity resonators makes these systems an interesting resource for storing encoded quantum bits. To perform a quantum gate on this encoded information, however, complex nonlinear operations must be applied to the many levels of the oscillator simultaneously. In this work, we introduce the Selective Number-dependent Arbitrary Phase (SNAP) gate, which imparts a different phase to each Fock state component using an off-resonantly coupled qubit. We show that the SNAP gate allows control over the quantum phases by correcting the unwanted phase …
