Lower bounds on the complexity of simulating quantum gates
arXiv:quant-ph/0307190 · doi:10.1103/PhysRevA.68.052311
Abstract
We give a simple proof of a formula for the minimal time required to simulate a two-qubit unitary operation using a fixed two-qubit Hamiltonian together with fast local unitaries. We also note that a related lower bound holds for arbitrary n-qubit gates.
6 pages
References in corpus (16)
- Entanglement of a Pair of Quantum Bits
- Time Optimal Control in Spin Systems
- Optimal Creation of Entanglement Using a Two--Qubit Gate
- A geometric theory of non-local two-qubit operations
- Nonlocal properties of two-qubit gates and mixed states and optimization of quantum computations
- Quantum dynamics as a physical resource
- Entanglement capabilities of non-local Hamiltonians
- Universal quantum computation and simulation using any entangling Hamiltonian and local unitaries
- Universal simulation of Hamiltonian dynamics for qudits
- Optimal simulation of two-qubit Hamiltonians using general local operations
- Efficient Refocussing of One Spin and Two Spin Interactions for NMR Quantum Computation
- Efficient implementation of selective recoupling in heteronuclear spin systems using Hadamard matrices
- Characterization of non-local gates
- Interaction cost of non-local gates
- Optimal Entanglement Generation from Quantum Operations
- Optimal simulation of nonlocal Hamiltonians using local operations and classical communication
Cited by in corpus (24)
- Performance of Deterministic Dynamical Decoupling Schemes: Concatenated and Periodic Pulse Sequences
- Quantum Computing with NMR
- Optimal Control-Based Efficient Synthesis of Building Blocks of Quantum Algorithms Seen in Perspective from Network Complexity towards Time Complexity
- Long-distance spin-spin coupling via floating gates
- Recognizing Small-Circuit Structure in Two-Qubit Operators and Timing Hamiltonians to Compute Controlled-Not Gates
- Distance Bounds on Quantum Dynamics
- Time Optimal Control of Coupled Qubits Under Non-Stationary Interactions
- Conditions for optimal construction of two-qubit non-local gates
- How difficult is it to prepare a quantum state?
- Long-Distance Entanglement of Spin Qubits via Quantum Hall Edge States
- Construction and local equivalence of dual-unitary operators: from dynamical maps to quantum combinatorial designs
- Quantum Optimal Control via Semi-Automatic Differentiation
- Time-optimal synthesis of unitary transformations in coupled fast and slow qubit system
- Time-optimal CNOT between indirectly coupled qubits in a linear Ising chain
- Gate simulation and lower bounds on the simulation time
- Quantum Control via Geometry: An explicit example
- Reversible simulation of bipartite product Hamiltonians
- Simulating Hamiltonian dynamics using many-qudit Hamiltonians and local unitary control
- Time Reversal and n-qubit Canonical Decompositions
- Quantum brachistochrone problem for two spins-1/2 with anisotropic Heisenberg interaction
- Towards Large-Scale Quantum Computation
- Tensor Norms and the Classical Communication Complexity of Nonlocal Quantum Measurement
- Two-step relaxation in local many-body Floquet systems
- Optimal Simulation of a Perfect Entangler