Lower bounds on the complexity of simulating quantum gates
classification
🪐 quant-ph
keywords
gateslowertwo-qubitarbitraryboundboundscomplexityfast
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.