Synthesis and upper bound of Schmidt rank of the bipartite controlled-unitary gates
arXiv:2209.04799 · doi:10.1002/andp.202200317
Abstract
Quantum circuit model is the most popular paradigm for implementing complex quantum computation. Based on Cartan decomposition, we show that generalized controlled- (GCX) gates, single-qubit rotations about the - and -axes, and single-partite - and -rotation-types which are defined in this paper are sufficient to simulate a controlled-unitary gate with controlling on . In the scenario of the unitary gate with that is locally equivalent to a diagonal unitary on , GCX gates and single-partite - and -rotation-types are required to simulate it. The quantum circuit for implementing and are presented. Furthermore, we find with controlling has Schmidt rank two, and in other cases the diagonalized form of the target unitaries can be expanded in terms of specific simple types of product unitary operators.
arXiv comment10 pages, 6 figures
References in corpus (36)
- Elementary gates for quantum computation
- Fast universal quantum control above the fault-tolerance threshold in silicon
- Experimental Demonstration of Blind Quantum Computing
- Optimal Quantum Circuits for General Two-Qubit Gates
- Methodology for quantum logic gate constructions
- Minimal Universal Two-qubit Quantum Circuits
- A single-photon switch and transistor enabled by a solid-state quantum memory
- Quantum dynamics as a physical resource
- A Photon-Photon Quantum Gate Based on Rydberg Interactions
- Entanglement purification for Quantum Computation
- A CNOT gate between multiphoton qubits encoded in two cavities
- Optimized Entanglement Purification
- Integrated-optics heralded controlled-NOT gate for polarization-encoded qubits
- Fusing multiple W states simultaneously with a Fredkin gate
- A controlled-NOT gate for frequency-bin qubits
- Synthesis of Multivalued Quantum Logic Circuits by Elementary Gates
- Optimal conversion of non--local unitary operations
- Blind quantum computation with noise environment
- Low-cost Fredkin gate with auxiliary space
- Efficient implementation of bipartite nonlocal unitary gates using prior entanglement and classical communication
- Quantum circuits for maximally entangled states
- Optimal synthesis of the Fredkin gate in a multilevel system
- Operator-Schmidt decompositions and the Fourier transform, with applications to the operator-Schmidt numbers of unitaries
- Universal quantum multi-qubit entangling gates with auxiliary spaces
- Nonlocal and controlled unitary operators of Schmidt rank three
- Optimal synthesis of multivalued quantum circuit
- Decomposition of bipartite and multipartite unitary gates into the product of controlled unitary gates
- All unitaries having operator Schmidt rank 2 are controlled unitaries
- Entanglement cost and entangling power of bipartite unitary and permutation operators
- On the Schmidt-rank-three bipartite and multipartite unitary operator
- Entangling and assisted entangling power of bipartite unitary operations
- Efficient Fusion of Photonic W-states with Nonunitary Partial-swap Gates
- Two-party LOCC convertibility of quadpartite states and Kraus-Cirac number of two-qubit unitaries
- Blind quantum computation with a heralded single photon source
- Constructing three-qubit unitary gates in terms of Schmidt rank and CNOT gates
- Collective unitary evolution with linear optics by Cartan decomposition