We provide an $Ω(log(n))$ lower bound for the depth of any quantum circuit generating the unique groundstate of Kitaev's spherical code. No circuit-depth lower bound was known before on this code in the general case where the gates can connect qubits even if they are far away; To the best of our knowledge, this is the first time a quantum circuit-depth lower bound is given for unique ground state of a {\it gapped} local Hamiltonian. Providing a lower bound in this case seems more challenging, since such systems exhibit exponential decay of correlations and standard lower bound techniques do not apply. We prove our lower bound by introducing the new notion of $γ$ -separation, and analyzing its behavior using algebraic topology arguments. We extend out methods also to a wide class of polygonal complexes beyond the sphere, and prove a circuit-depth lower bound whenever the complex does not have a small "bottle neck" (in a sense which we define). Here our lower bound on the circuit depth is only $Ω(logloglog(n))$ . We conjecture that the correct lower bound is at least $Ω(log(log(n))$ , but this seems harder to achieve due to the possibility of hyperbolic geometry. For general simplicial complexes the lack of geometrical restriction on the gates becomes considerably more problematic than for the sphere, and we need to thoroughly modify the original argument in order to get a meaningful bound. To the best of our knowledge, this is the first time the class of trivial quantum states is separated from the class of unique ground states of gapped local Hamiltonians; we provide a survey of the current status of this hierarchy for completeness.The tools developed here will be useful in various contexts in which quantum circuit depth lower bounds are of interest, including the study of topological order, quantum computational complexity and quantum algorithmic speedups.We provide an $Ω(log(n))$ lower bound for the depth of any quantum circuit generating the unique groundstate of Kitaev's spherical code. No circuit-depth lower bound was known before on this code in the general case where the gates can connect qubits even if they are far away; To the best of our knowledge, this is the first time a quantum circuit-depth lower bound is given for unique ground state of a {\it gapped} local Hamiltonian. Providing a lower bound in this case seems more challenging, since such systems exhibit exponential decay of correlations and standard lower bound techniques do not apply. We prove our lower bound by introducing the new notion of $γ$-separation, and analyzing its behavior using algebraic topology arguments. We extend out methods also to a wide class of polygonal complexes beyond the sphere, and prove a circuit-depth lower bound whenever the complex does not have a small "bottle neck" (in a sense which we define). Here our lower bound on the circuit depth is only $Ω(logloglog(n))$. We conjecture that the correct lower bound is at least $Ω(log(log(n))$, but this seems harder to achieve due to the possibility of hyperbolic geometry. For general simplicial complexes the lack of geometrical restriction on the gates becomes considerably more problematic than for the sphere, and we need to thoroughly modify the original argument in order to get a meaningful bound. To the best of our knowledge, this is the first time the class of trivial quantum states is separated from the class of unique ground states of gapped local Hamiltonians; we provide a survey of the current status of this hierarchy for completeness.The tools developed here will be useful in various contexts in which quantum circuit depth lower bounds are of interest, including the study of topological order, quantum computational complexity and quantum algorithmic speedups.

arXiv:1810.03912Oct 9, 20189 citations

Coherence and Imaginarity as Resources in Quantum Circuit Complexity

Linlin Ye, Zhaoqi Wu, Nanrun Zhou

Quantum circuit complexity quantifies the minimal number of gates needed to realize a unitary transformation and plays a central role in quantum computation. In this work, we investigate the complexity of quantum circuits through coherence and imaginarity resources. We establish a lower bound on the circuit cost by the Tsallis relative $α$ entropy of cohering power, which is shown to be tighter than the one presented by Bu et al.[\textit{Communications in Mathematical Physics} 405, no. 7 (2024):161] under restrictive conditions. As a consequence, we obtain the relationships between the circuit cost and the coherence generating power via probabilistic average in terms of skew information/relative entropy, and present explicit bounds of the circuit cost for typical quantum gates. Moreover, we derive lower bounds on the circuit cost via the imaginaring power of the circuit, induced by the Tsallis relative $α$ entropy and relative entropy. We demonstrate that imaginarity can yield nontrivial constraints on the circuit cost even when coherence-based lower bounds are zero (e.g., for the $T$ gate), which implies that imaginarity may provide advantages under certain circumstances compared with coherence. Our results may help better understand the connections between quantum resources and circuit complexity.Quantum circuit complexity quantifies the minimal number of gates needed to realize a unitary transformation and plays a central role in quantum computation. In this work, we investigate the complexity of quantum circuits through coherence and imaginarity resources. We establish a lower bound on the circuit cost by the Tsallis relative $α$ entropy of cohering power, which is shown to be tighter than the one presented by Bu et al.[\textit{Communications in Mathematical Physics} 405, no. 7 (2024):161] under restrictive conditions. As a consequence, we obtain the relationships between the circuit cost and the coherence generating power via probabilistic average in terms of skew information/relative entropy, and present explicit bounds of the circuit cost for typical quantum gates. Moreover, we derive lower bounds on the circuit cost via the imaginaring power of the circuit, induced by the Tsallis relative $α$ entropy and relative entropy. We demonstrate that imaginarity can yield nontrivial constraints on the circuit cost even when coherence-based lower bounds are zero (e.g., for the $T$ gate), which implies that imaginarity may provide advantages under certain circumstances compared with coherence. Our results may help better understand the connections between quantum resources and circuit complexity.

quant-pharXiv:2604.05660Advanced Quantum TechnologiesApr 8, 20266 citations

A lower bound method for quantum circuits

Debajyoti Bera

Information Processing LettersMay 10, 20115 citations

Rademacher complexity of noisy quantum circuits

Kaifeng Bu, Dax Enshan Koh, Lu Li +2 more

Noise in quantum systems is a major obstacle to implementing many quantum algorithms on large quantum circuits. In this work, we study the effects of noise on the Rademacher complexity of quantum circuits, which is a measure of statistical complexity that quantifies the richness of classes of functions generated by these circuits. We consider noise models that are represented by convex combinations of unitary channels and provide both upper and lower bounds for the Rademacher complexities of quantum circuits characterized by these noise models. In particular, we find a lower bound for the Rademacher complexity of noisy quantum circuits that depends on the Rademacher complexity of the corresponding noiseless quantum circuit as well as the free robustness of the circuit. Our results show that the Rademacher complexity of quantum circuits decreases with the increase in noise.Noise in quantum systems is a major obstacle to implementing many quantum algorithms on large quantum circuits. In this work, we study the effects of noise on the Rademacher complexity of quantum circuits, which is a measure of statistical complexity that quantifies the richness of classes of functions generated by these circuits. We consider noise models that are represented by convex combinations of unitary channels and provide both upper and lower bounds for the Rademacher complexities of quantum circuits characterized by these noise models. In particular, we find a lower bound for the Rademacher complexity of noisy quantum circuits that depends on the Rademacher complexity of the corresponding noiseless quantum circuit as well as the free robustness of the circuit. Our results show that the Rademacher complexity of quantum circuits decreases with the increase in noise.

arXiv:2103.03139Mar 4, 20215 citations

We provide an

Ω(log(n))

lower bound for the depth of any quantum circuit generating the unique groundstate of Kitaev's spherical code. No circuit-depth lower bound was known before on this code in the general case where the gates can connect qubits even if they are far away; To the best of our knowledge, this is the first time a quantum circuit-depth lower bound is given for unique ground state of a {\it gapped} local Hamiltonian. Providing a lower bound in this case seems more challenging, since such systems exhibit exponential decay of correlations and standard lower bound techniques do not apply. We prove our lower bound by introducing the new notion of

γ

-separation, and analyzing its behavior using algebraic topology arguments. We extend out methods also to a wide class of polygonal complexes beyond the sphere, and prove a circuit-depth lower bound whenever the complex does not have a small "bottle neck" (in a sense which we define). Here our lower bound on the circuit depth is only

Ω(logloglog(n))

. We conjecture that the correct lower bound is at least

Ω(log(log(n))

, but this seems harder to achieve due to the possibility of hyperbolic geometry. For general simplicial complexes the lack of geometrical restriction on the gates becomes considerably more problematic than for the sphere, and we need to thoroughly modify the original argument in order to get a meaningful bound. To the best of our knowledge, this is the first time the class of trivial quantum states is separated from the class of unique ground states of gapped local Hamiltonians; we provide a survey of the current status of this hierarchy for completeness.The tools developed here will be useful in various contexts in which quantum circuit depth lower bounds are of interest, including the study of topological order, quantum computational complexity and quantum algorithmic speedups.

α

entropy of cohering power, which is shown to be tighter than the one presented by Bu et al.[\textit{Communications in Mathematical Physics} 405, no. 7 (2024):161] under restrictive conditions. As a consequence, we obtain the relationships between the circuit cost and the coherence generating power via probabilistic average in terms of skew information/relative entropy, and present explicit bounds of the circuit cost for typical quantum gates. Moreover, we derive lower bounds on the circuit cost via the imaginaring power of the circuit, induced by the Tsallis relative

α

entropy and relative entropy. We demonstrate that imaginarity can yield nontrivial constraints on the circuit cost even when coherence-based lower bounds are zero (e.g., for the

T

gate), which implies that imaginarity may provide advantages under certain circumstances compared with coherence. Our results may help better understand the connections between quantum resources and circuit complexity.