Physical Review Letters · 2020 · 83 citations · 68 references
ComputingComputer SciencePhysicsCircuit TheoryComputational PhysicsQuantum ComputingCircuit ComplexityComputational ComplexityQuantum CircuitsQuantum ComputationQuantum GatesQuantum SimulationHamiltonian ComplexityHamiltonian SimulationHamiltonian Simulation GatesQuantum Circuit ComplexityQuantum Circuit ModelQuantum Circuit SimulationQuantum Hamiltonian SimulationQuantum Simulation Complexity
We propose a modification to Nielsen's circuit complexity for Hamiltonian simulation using the Suzuki-Trotter (ST) method, which provides a network like structure for the quantum circuit. This leads to an optimized gate counting linear in the geodesic distance and spatial volume, unlike in the original proposal. The optimized ST iteration order is correlated with the error tolerance and plays the role of an anti-de Sitter radial coordinate. The density of gates is shown to be monotonic with the tolerance and a holographic interpretation using path-integral optimization is given.
68
Quantum information and computation
Charles H. Bennett, David P. DiVincenzo · Nature · 2000 · 3.3K citations
Quantum computation and quantum information
Thierry Paul · Mathematical Structures in Computer Science · 2007 · 1.9K citations
Computing, Computer Science, Physics +13
Holographic Complexity Equals Bulk Action?
Adam R. Brown, Daniel A. Roberts, Leonard Susskind et al. · Physical Review Letters · 2016 · 872 citations · Full text
On renormalization group flows in four dimensions
Zohar Komargodski, A. Schwimmer · Journal of High Energy Physics · 2011 · 823 citations · Full text