Recognizing Small-Circuit Structure in Two-Qubit Operators and Timing Hamiltonians to Compute Controlled-Not Gates

Abstract

This work proposes numerical tests which determine whether a two-qubit operator has an atypically simple quantum circuit. Specifically, we describe formulae, written in terms of matrix coefficients, characterizing operators implementable with exactly zero, one, or two controlled-not (CNOT) gates and all other gates being one-qubit. We give an algorithm for synthesizing two-qubit circuits with optimal number of CNOT gates, and illustrate it on operators appearing in quantum algorithms by Deutsch-Josza, Shor and Grover. In another application, our explicit numerical tests allow timing a given Hamiltonian to compute a CNOT modulo one-qubit gates, when this is possible.

4 pages, circuit examples, an algorithm and a new application (v3)

References in corpus (8)

• Optimal Quantum Circuits for General Two-Qubit Gates
• A geometric theory of non-local two-qubit operations
• Minimal Universal Two-qubit Quantum Circuits
• A practical scheme for quantum computation with any two-qubit entangling gate
• A universal quantum circuit for two-qubit transformations with three CNOT gates
• An Arbitrary Two-qubit Computation In 23 Elementary Gates
• Optimal quantum circuit synthesis from Controlled-U gates
• Lower bounds on the complexity of simulating quantum gates

Cited by in corpus (27)

• Synthesis of Quantum Logic Circuits
• Universal quantum gates for hybrid systems assisted by quantum dots inside double-sided optical microcavities
• Compact quantum gates on electron-spin qubits assisted by diamond nitrogen-vacancy centers inside cavities
• Characterization of two-qubit perfect entanglers
• Scalable quantum computing based on stationary spin qubits in coupled quantum dots inside double-sided optical microcavities
• Optical Simulation of Yang-Baxter Equation
• Exact and practical pattern matching for quantum circuit optimization
• The role of quantum coherence in energy fluctuations
• Constructive Quantum Shannon Decomposition from Cartan Involutions
• Universal quantum multi-qubit entangling gates with auxiliary spaces
• Fixed-Depth Two-Qubit Circuits and the Monodromy Polytope
• Towards optimization of quantum circuits
• Simulating Hamiltonian dynamics using many-qudit Hamiltonians and local unitary control
• Time Reversal and n-qubit Canonical Decompositions
• Discretized quantum adiabatic process for free fermions and comparison with the imaginary-time evolution
• Introduction to UniversalQCompiler
• Quantum Computing Simulation of a Mixed Spin-Boson Hamiltonian and Its Performance for a Cavity Quantum Electrodynamics Problem
• Entangling power of two-qubit unitary operations
• Matrix product state ansatz for the variational quantum solution of the Heisenberg model on Kagome geometries
• A Theory of Direct Randomized Benchmarking
• Photonic implementation of the quantum Morra game
• Variational Quantum Imaginary Time Evolution for Matrix Product State Ansatz with Tests on Transcorrelated Hamiltonians
• Typical Machine Learning Datasets as Low-Depth Quantum Circuits
• Simplifying Quantum Circuits via Circuit Invariants and Dressed CNOTs
• Phase Estimation with Compressed Controlled Time Evolution
• Universal quantum gates for photon-atom hybrid systems assisted by bad cavities
• Robust composite two-qubit gates for silicon-based spin qubits