Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 88 tok/s
Gemini 2.5 Pro 56 tok/s Pro
GPT-5 Medium 17 tok/s
GPT-5 High 21 tok/s Pro
GPT-4o 90 tok/s
GPT OSS 120B 468 tok/s Pro
Kimi K2 213 tok/s Pro
2000 character limit reached

Universal Early-Time Growth in Quantum Circuit Complexity (2406.12990v2)

Published 18 Jun 2024 in hep-th and quant-ph

Abstract: We show that quantum circuit complexity for the unitary time evolution operator of any time-independent Hamiltonian is bounded by linear growth at early times, independent of any choices of the fundamental gates or cost metric. Deviations from linear early-time growth arise from the commutation algebra of the gates and are manifestly negative for any circuit, decreasing the linear growth rate and leading to a bound on the growth rate of complexity of a circuit at early times. We illustrate this general result by applying it to qubit and harmonic oscillator systems, including the coupled and anharmonic oscillator. By discretizing free and interacting scalar field theories on a lattice, we are also able to extract the early-time behavior and dependence on the lattice spacing of complexity of these field theories in the continuum limit, demonstrating how this approach applies to systems that have been previously difficult to study using existing techniques for quantum circuit complexity.

Citations (3)
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.