Arbitrary Unitary Operations Research Articles

Quantum subspace controllability implying full controllability

In the analysis of controllability of finite dimensional quantum systems, subspace controllability refers to the situation where the underlying Hilbert space splits into the direct sum of invariant subspaces, and, on each of such invariant subspaces, it is possible to generate any arbitrary unitary operation using appropriate control functions. This is a typical situation in the presence of symmetries for the dynamics.We investigate whether and when if subspace controllability is verified, the addition of an extra Hamiltonian to the dynamics implies full controllability of the system. Under the natural (and necessary) condition that the new Hamiltonian connects all the invariant subspaces, we show that this is always the case, except for a very specific case we shall describe. Even in this specific case, a weaker notion of controllability, controllability of the state (Pure State Controllability) is verified.

The Goldilocks principle of learning unitaries by interlacing fixed operators with programmable phase shifters on a photonic chip

Programmable photonic integrated circuits represent an emerging technology that amalgamates photonics and electronics, paving the way for light-based information processing at high speeds and low power consumption. Programmable photonics provides a flexible platform that can be reconfigured to perform multiple tasks, thereby holding great promise for revolutionizing future optical networks and quantum computing systems. Over the past decade, there has been constant progress in developing several different architectures for realizing programmable photonic circuits that allow for realizing arbitrary discrete unitary operations with light. Here, we systematically investigate a general family of photonic circuits for realizing arbitrary unitaries based on a simple architecture that interlaces a fixed intervening layer with programmable phase shifter layers. We introduce a criterion for the intervening operator that guarantees the universality of this architecture for representing arbitrary N×N\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$N \ imes N$$\\end{document} unitary operators with N+1\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$N+1$$\\end{document} phase layers. We explore this criterion for different photonic components, including photonic waveguide lattices and meshes of directional couplers, which allows the identification of several families of photonic components that can serve as the intervening layers in the interlacing architecture. Our findings pave the way for efficiently designing and realizing novel families of programmable photonic integrated circuits for multipurpose analog information processing.

A universal programmable Gaussian boson sampler for drug discovery

Gaussian boson sampling (GBS) has the potential to solve complex graph problems, such as clique finding, which is relevant to drug discovery tasks. However, realizing the full benefits of quantum enhancements requires large-scale quantum hardware with universal programmability. Here we have developed a time-bin-encoded GBS photonic quantum processor that is universal, programmable and software-scalable. Our processor features freely adjustable squeezing parameters and can implement arbitrary unitary operations with a programmable interferometer. Leveraging our processor, we successfully executed clique finding on a 32-node graph, achieving approximately twice the success probability compared to classical sampling. As proof of concept, we implemented a versatile quantum drug discovery platform using this GBS processor, enabling molecular docking and RNA-folding prediction tasks. Our work achieves GBS circuitry with its universal and programmable architecture, advancing GBS toward use in real-world applications.

Concealed Quantum Telecomputation for Anonymous 6G URLLC Networks

Distributed learning and multi-tier computing are the key ingredients to ensure ultra-reliable and low-latency communication (URLLC) in 6G networks. The distinct transition from connected things in 5G URLLC networks to connected intelligence in 6G URLLC networks requires ultra-secure communication due to the massive amount of private data. However, it is a challenging task to ensure stringent 6G URLLC requirements along with user privacy and data security in distributed networks. In this paper, we devise a distributed quantum computation protocol to perform a nonlocal controlled unitary operation on a bipartite input state in concealed and counterfactual manner and integrate it with anonymous quantum communication networks. This distributed protocol allows Bob to apply an arbitrary single-qubit unitary operator on Alice’s qubit in a controlled and probabilistic fashion, without revealing the operator to her and without transmitting any physical particle over the quantum channel—called the counterfactual concealed telecomputation (CCT). It is shown that the CCT protocol neither requires the preshared entanglement nor depends on the bipartite input state and that the single-qubit unitary teleportation is a special case of CCT. The quantum circuit for CCT can be implemented using the (chained) quantum Zeno gates. The protocol becomes deterministic with simplified circuit implementation if the initial composite state of Alice and Bob is a Bell-type state. Furthermore, we provide numerical examples of quantum anonymous broadcast networks using the CCT protocol and show their degrees of anonymity in the presence of malicious users.

Implementing arbitrary quantum operations via quantum walks on a cycle graph

The quantum circuit model is the most commonly used model for implementing quantum computers and quantum neural networks whose essential tasks are to realize certain unitary operations. Here we propose an alternative approach; we use a simple discrete-time quantum walk (DTQW) on a cycle graph to model an arbitrary unitary operation $U(N)$ without the need to decompose it into a sequence of gates of smaller sizes. Our model is essentially a quantum neural network based on DTQW. Firstly, it is universal as we show that any unitary operation $U(N)$ can be realized via an appropriate choice of coin operators. Secondly, our DTQW-based neural network can be updated efficiently via a learning algorithm, i.e., a modified stochastic gradient descent algorithm adapted to our network. By training this network, one can promisingly find approximations to arbitrary desired unitary operations. With an additional measurement on the output, the DTQW-based neural network can also implement general measurements described by positive-operator-valued measures (POVMs). We show its capacity in implementing arbitrary 2-outcome POVM measurements via numeric simulation. We further demonstrate that the network can be simplified and can overcome device noises during the training so that it becomes more friendly for laboratory implementations. Our work shows the capability of the DTQW-based neural network in quantum computation and its potential in laboratory implementations.

Multi-wavelength dual-polarization optical unitary processor using integrated multi-plane light converter

An optical unitary processor (OUP) is a programmable photonic circuit to achieve arbitrary unitary operation for various applications, including optical communication, deep learning, and quantum computing. Conventionally, OUPs are implemented by cascading 2 × 2 reconfigurable interferometers, but this scheme cannot easily be extended to multiple wavelength and polarization channels due to the strict requirement to employ 50:50 beam splitters. Here, we demonstrate that an OUP using multiport directional couplers (DCs) can realize independent unitary conversion of multiple wavelength and polarization channels simultaneously. This OUP is based on the multi-plane light conversion (MPLC) principle, which does not require a specific transformation at each layer, unlike the conventional scheme. Thanks to this unique robustness of the MPLC method and strong wavelength/polarization dependence of multiport DCs, we numerically show that independent unitary transformations can be applied to up to 16 channels (2 polarization × 4 wavelengths) using a single device.

Circulating genuine multiparty entanglement in a quantum network

We propose a deterministic scheme of generating genuine multiparty entangled states in quantum networks of arbitrary size having various geometric structures---we refer to it as entanglement circulation. The procedure involves optimization over a set of two-qubit arbitrary unitary operators and the entanglement of the initial resource state. We report that the set of unitary operators that maximize the genuine multipartite entanglement quantified via generalized geometric measure (GGM) is not unique. We prove that the GGM of the resulting state of arbitrary qubits coincides with the minimum GGM of the initial resource states. By fixing the output state as the six-qubit one, we find the optimal way to create such states according to the available resource. Moreover, we show that the method proposed here can be implemented by using logic gates, or by using the time dynamics of realizable spin Hamiltonians. In case of an ordered system, GGM varies periodically with time while the evolution via disordered models lead to a low but constant multipartite entanglement in outputs at a critical time, which decreases exponentially with the increase of the strength of the disorder.

Numerical analysis of quantum circuits for state preparation and unitary operator synthesis

We perform optimal-control-theory calculations to determine the minimum number of two-qubit CNOT gates needed to perform quantum state preparation and unitary operator synthesis for few-qubit systems. By considering all possible gate configurations, we determine the maximum achievable fidelity as a function of quantum circuit size. This information allows us to identify the minimum circuit size needed for a specific target operation and enumerate the different gate configurations that allow a perfect implementation of the operation. We find that there are a large number of configurations that all produce the desired result, even at the minimum number of gates. We also show that the number of entangling gates can be reduced if we use multi-qubit entangling gates instead of two-qubit CNOT gates, as one might expect based on parameter counting calculations. In addition to treating the general case of arbitrary target states or unitary operators, we apply the numerical approach to the special case of synthesizing the multi-qubit Toffoli gate. This approach can be used to investigate any other specific few-qubit task and provides insight into the tightness of different bounds in the literature.

Geometric manipulation of a decoherence-free subspace in atomic ensembles

We consider an ensemble of atoms with $\Lambda$-type level structure trapped in a single-mode cavity, and propose a geometric scheme of coherent manipulation of quantum states on the subspace of zero-energy states within the quantum Zeno subspace of the system. We find that the particular subspace inherits the decoherence-free nature of the quantum Zeno subspace and features a symmetry-protected degeneracy, fulfilling all the conditions for a universal scheme of arbitrary unitary operations on it.

Unitary two-state quantum operators realized by quadrupole fields in the electron microscope

In this work, a novel method for using a set of electromagnetic quadrupole fields is presented to implement arbitrary unitary operators on a two-state quantum system of electrons. In addition to analytical derivations of the required quadrupole and beam settings which allow an easy direct implementation, numerical simulations of realistic scenarios show the feasibility of the proposed setup. This is expected to pave the way not only for new measurement schemes in electron microscopy and related fields but even one day for the implementation of quantum computing in the electron microscope.

Integrated InP optical unitary converter with compact half-integer multimode interferometers

Integrated optical unitary converters (OUCs) are vital devices for various emerging applications such as mode-multiplexed optical communication, optical neural networks, and quantum computing. In order to realize large-scale OUCs in a limited footprint, the number of elements, as well as the size of each element, is important. In this work, we present a novel type of OUC using half-integer multimode interferometers (MMIs) based on the multi-plane light conversion (MPLC) concept. A half-integer MMI enables unitary coupling among the multiple input and output ports, while requiring only half the length of a conventional uniform MMI. Although the splitting ratio is not uniform across the ports, we show both numerically and experimentally that arbitrary unitary operation can still be achieved with comparable performance. We fabricate 4×4 OUC with half-integer MMIs on the monolithic InP platform and experimentally demonstrate reconfigurable 4-mode sorting and switching with a significantly reduced footprint compared with the conventional OUCs using uniform MMIs.

Cost-optimal single-qubit gate synthesis in the Clifford hierarchy

For universal quantum computation, a major challenge to overcome for practical implementation is the large amount of resources required for fault-tolerant quantum information processing. An important aspect is implementing arbitrary unitary operators built from logical gates within the quantum error correction code. A synthesis algorithm can be used to approximate any unitary gate up to arbitrary precision by assembling sequences of logical gates chosen from a small set of universal gates that are fault-tolerantly performable while encoded in a quantum error-correction code. However, current procedures do not yet support individual assignment of base gate costs and many do not support extended sets of universal base gates. We analysed cost-optimal sequences using an exhaustive search based on Dijkstra’s pathfinding algorithm for the canonical Clifford+Tset of base gates and compared them to when additionally includingZ-rotations from higher orders of the Clifford hierarchy. Two approaches of assigning base gate costs were used. First, costs were reduced toT-counts by recursively applying aZ-rotation catalyst circuit. Second, costs were assigned as the average numbers of raw (i.e. physical level) magic states required to directly distil and implement the gates fault-tolerantly. We found that the average sequence cost decreases by up to54±3%when using theZ-rotation catalyst circuit approach and by up to33±2%when using the magic state distillation approach. In addition, we investigated observed limitations of certain assignments of base gate costs by developing an analytic model to estimate the proportion of sets ofZ-rotation gates from higher orders of the Clifford hierarchy that are found within sequences approximating random target gates.

Coherence cost for violating conservation laws

Nature imposes many restrictions on the operations that we perform. Many of these restrictions can be interpreted in terms of {\it resource} required to realize the operations. Classifying required resource for different types of operations and determining the amount of resource are the crucial subjects in physics. Among many types of operations, a unitary operation is one of the most fundamental operation that has been studied for long time in terms of the resource implicitly and explicitly. Yet, it is a long standing open problem to identify the resource and to clarify the necessary and sufficient amount of resource for implementing a general unitary operation under conservation laws. In this paper, we provide a solution to this open problem. We derive an asymptotically exact equality that clarifies the necessary and sufficient amount of quantum coherence as a resource to implement arbitrary unitary operation within a desired error. In this equality, the required coherence cost is asymptotically expressed with the implementation error and the degree of violation of conservation law in the desired unitary operation. We also discuss the underlying physics in several physical situations from the viewpoint of coherence cost based on the equality. This work does not only provide a solution to a long-standing problem on the unitary control, but also clarifies the key question of the resource theory of the quantum channels in the region of resource theory of asymmetry, for the case of unitary channels.

Engineering cross resonance interaction in multi-modal quantum circuits

The existing scalable superconducting quantum processors have only nearest-neighbor coupling. This leads to a reduced circuit depth, requiring a large series of gates to perform an arbitrary unitary operation in such systems. Recently, multi-modal devices have been demonstrated as a promising candidate for small quantum processor units. Always on longitudinal coupling in such circuits leads to implementation of native high fidelity multi-qubit gates. We propose an architecture using such devices as building blocks for a highly connected larger quantum circuit. To demonstrate a quantum operation between such blocks, a standard transmon is coupled to the multi-modal circuit using a 3D bus cavity giving rise to small exchange interaction between the transmon and one of the modes. We study the cross-resonance interaction in such systems and characterize the entangling operation and the unitary imperfections and crosstalk as a function of device parameters. Finally, we tune up the cross-resonance drive to implement multi-qubit gates in this architecture.

Photonic scheme of quantum phase estimation for quantum algorithms via cross-Kerr nonlinearities under decoherence effect.

Quantum phase estimation (QPE) is the key procedure in various quantum algorithms. The main aim of the QPE scheme is to estimate the phase of an unknown eigenvalue, corresponding to an eigenstate of an arbitrary unitary operation. The QPE scheme can be applied as a subroutine to design many quantum algorithms. In this paper, we propose the basic structure of a QPE scheme that could be applied in quantum algorithms, with feasibility by utilizing cross-Kerr nonlinearities (controlled-unitary gates) and linearly optical devices. Subsequently, we analyze the efficiency and the performance of the controlled-unitary gate. This gate consists of a controlled-path gate and a merging-path gate via cross-Kerr nonlinearities under the decoherence effect. Also shown in this paper is a method by which to enhance robustness against the decoherence effect to provide a reliable QPE scheme based on controlled-unitary gates.

Work extraction using Gaussian operations in noninteracting fermionic systems

We investigate work extraction from non-interacting fermions under arbitrary unitary operations and the more restricted class of Gaussian unitary operations that can be feasibly implemented. We characterize general quantum states in fermionic systems according to their ability to yield work (or not) under such transformations and study the limit for which multiple copies of passive states in fermionic systems can be activated for work extraction. We find that a sufficient number of copies of non-thermal passive states can achieve this, yielding an upper bound on the number of copies needed.

A Note of Coherence for Duality Quantum Computers Acting on Pure States

In this paper, we discuss the coherence for duality quantum computers under taking different unitary operators acting on pure states. Firstly, for arbitrary unitary operators, we give some general quantitative results of the coherence of output states. Secondly, for incoherence unitary operators, we obtain that the coherence of output states satisfies an inequality. In addition, we also give a conclusion of the coherence of output states under unitary permutation operators.

Entangling power of two-qubit unitary operations

The entangling power of a bipartite unitary operation shows the maximum created entanglement with the product input states. For an arbitrary two-qubit unitary operation, it is sufficient to consider its normalized operation U with parameters and c3. We show how to compute the entangling power of U when . In particular we construct the analytical expressions of entangling power of such U for two examples. We also formulate the entangling power of bipartite unitary operations of Schmidt rank two for any dimensions.

Universal quantum encryption for quantum signature using the swap test

We suggest a universal quantum encryption scheme suitable for use in quantum signature. The verifier in a variety of quantum signature protocols usually checks for the falsification of the quantum signature state pair by using a swap test. However, these quantum signature protocols are not secure against existential forgery attacks; We prove that the universal quantum encryption scheme proposed in this paper is secure against this type of forgery because it uses the non-(anti)commutativity of an arbitrary unitary operator. In addition, we demonstrate its use in a quantum signature. Moreover, the optimization of this encryption in comparison with other encryption schemes is presented.

Bidirectional quantum operation teleportation with different states

A new concept of bidirectional quantum operation teleportation (BQOT) is proposed, which is essentially a union of the idea of quantum operation teleportation (QOT) and bidirectional quantum teleportation (QT). This means that Alice can transmit an unknown single-qubit unitary operation [Formula: see text] on the remote Bob’s quantum system; and at the same time, Bob can also transmit an arbitrary single-qubit unitary operation [Formula: see text] on Alice’s quantum system. In this paper, we present three BQOT schemes via different quantum channels. Furthermore, using these quantum channels, we investigate the BQOT in noisy environments, such as phase-damping noise and amplitude-damping noise. We considered the influence of the noises on the process of these three BQOT protocols through analytical derivation of the fidelity. Moreover, these three schemes are amply compared with each other from five aspects, i.e. quantum resource consumption, operation complexity, classical resource consumption, success probability and efficiency. It is found that these schemes can be realized deterministically and the first scheme is better than the other two schemes.