Coherence and Imaginarity as Resources in Quantum Circuit Complexity

• URL: http://arxiv.org/abs/2604.05660v1
• Date: Tue, 07 Apr 2026 10:00:16 GMT
• Title: Coherence and Imaginarity as Resources in Quantum Circuit Complexity
• Abstract summary: Quantum circuit complexity quantifies the minimal number of gates needed to realize a unitary transformation.<n>We investigate the complexity of quantum circuits through coherence and imaginarity resources.
• Score: 3.836101499114878
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• Verifiable quantum advantage in extremely low depth [52.51019642214249]
  We give a problem that is solvable by shallow quantum circuits, hard for computation in time under lattice-based assumptions.<n>We prove that shallow quantum circuits have sufficient structure to solve certain classically hard tasks whose solutions can be verified efficiently.
  arXiv  Detail & Related papers  (2026-09-01T15:54:34Z)
• Reinforcement learning of quantum circuit architectures for molecular potential energy curves [0.39089069256361736]
  We present a reinforcement learning (RL) approach to learning a problem-dependent quantum circuit mapping.<n>For quantum chemistry, our RL framework takes as input a molecule and a discrete set of bond distances.<n>We demonstrate its effectiveness for the four-qubit and six-qubit lithium hydride molecules, as well as an eight-qubit H$_4$ chain.
  arXiv  Detail & Related papers  (2025-11-20T17:12:34Z)
• Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
  Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application.<n>We analyse the generation of random states in PQCs under restrictions on the qubits connectivities.<n>We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
  arXiv  Detail & Related papers  (2024-05-03T17:32:55Z)
• The Complexity of Being Entangled [0.0]
  Nielsen's approach to quantum state complexity relates the minimal number of quantum gates required to prepare a state to the length of geodesics computed with a certain norm on the manifold of unitary transformations. For a bipartite system, we investigate binding complexity, which corresponds to norms in which gates acting on a single subsystem are free of cost.
  arXiv  Detail & Related papers  (2023-11-07T19:00:02Z)
• Circuit complexity and functionality: a thermodynamic perspective [2.2988732018837177]
  We explore links between complexity and thermodynamics for functionally-equivalent circuits.<n>In particular, our framework provides a new perspective on the obfuscation of programs of arbitrary length.<n>We argue that fragmentation is unavoidable unless the complexity classes NP and coNP coincide.
  arXiv  Detail & Related papers  (2023-09-11T18:02:21Z)
• Quantum Circuit Completeness: Extensions and Simplifications [44.99833362998488]
  The first complete equational theory for quantum circuits has only recently been introduced. We simplify the equational theory by proving that several rules can be derived from the remaining ones. The complete equational theory can be extended to quantum circuits with ancillae or qubit discarding.
  arXiv  Detail & Related papers  (2023-03-06T13:31:27Z)
• Circuit Complexity in an interacting quenched Quantum Field Theory [0.0]
  We explore the effects of a quantum quench on the circuit complexity for a quenched quantum field theory having weakly coupled quartic interaction. We show the analytical computation of circuit complexity for the quenched and interacting field theory.
  arXiv  Detail & Related papers  (2022-09-07T18:00:03Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Entangling power and quantum circuit complexity [0.0]
  We discuss a simple such relationship when both the entanglement of a state and the cost of a unitary take small values. This bound implies that if entanglement entropies grow linearly in time, so does the cost. In the context of quantum simulation, it allows to compare digital and analog quantum simulators.
  arXiv  Detail & Related papers  (2021-04-07T18:01:06Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)
• On estimating the entropy of shallow circuit outputs [49.1574468325115]
  Estimating the entropy of probability distributions and quantum states is a fundamental task in information processing. We show that entropy estimation for distributions or states produced by either log-depth circuits or constant-depth circuits with gates of bounded fan-in and unbounded fan-out is at least as hard as the Learning with Errors problem.
  arXiv  Detail & Related papers  (2020-02-27T15:32:08Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.