Universal Configuration for Optimizing Complexity in Variational Distributed Quantum Circuits

• URL: http://arxiv.org/abs/2508.04464v1
• Date: Wed, 06 Aug 2025 14:03:52 GMT
• Title: Universal Configuration for Optimizing Complexity in Variational Distributed Quantum Circuits
• Authors: J. Montes, F. Borondo, Gabriel G. Carlo,
• Abstract summary: We show the existence of a universal optimal configuration for distributing single and two qubit gates across arbitrary intercore communication topologies.<n>We validate our predictions through numerical comparisons with the well established majorization criterion proposed in Ref 2.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Distributed quantum computing represents at present one of the most promising approaches to scaling quantum processors. Current implementations typically partition circuits into multiple cores, each composed of several qubits, with inter-core connectivity playing a central role in ensuring scalability. Identifying the optimal configuration -- defined as the arrangement that maximizes circuit complexity with minimal depth -- thus constitutes a fundamental design challenge. In this work, we demonstrate, both analytically and numerically, the existence of a universal optimal configuration for distributing single and two qubit gates across arbitrary intercore communication topologies in variational distributed circuits. Our proof is based on a complexity measure based on Markov matrices, which quantifies the convergence rate toward the Haar measure, as introduced by Weinstein et al. Finally, we validate our predictions through numerical comparisons with the well established majorization criterion proposed in Ref 2.

Related papers

• Variational Quantum Sensing for Structured Linear Function Estimation [0.7783491525078104]
  We study the variational optimization of entangled probe states for quantum sensing tasks.<n>Specifically, we consider scenarios where each qubit in a spin-1/2 array accumulates a phase phi_i = alpha_i * theta.<n>We benchmark the optimized circuits for two relevant cases: (i) uniform encoding, where all qubits contribute equally to the phase function, and (ii) a custom encoding where a central qubit dominates the weight vector.
  arXiv  Detail & Related papers  (2025-07-29T17:48:14Z)
• Universality in the Anticoncentration of Chaotic Quantum Circuits [0.0]
  We identify a emphuniversal functional form that governs anticoncentration in random quantum circuits.<n>We support this claim through analytical results for ensembles of random tensor-network states and random-phase models.<n>Our findings underscore the pivotal role of finite-size and finite-depth effects in shaping anticoncentration and introduce a practical framework for benchmarking quantum devices using shallow circuits.
  arXiv  Detail & Related papers  (2025-02-28T19:00:26Z)
• Efficient Implementation of Arbitrary Two-Qubit Gates via Unified Control [30.657387004518604]
  The native gate set governs the accuracy of basic quantum operations and dictates the complexity of implementing quantum algorithms.<n>Here, we experimentally demonstrate a unified and highly versatile gate scheme capable of generating arbitrary two-qubit gates.<n>We achieve high fidelities averaging $99.37 pm 0.07%$ across a wide range of commonly used two-qubit unitaries.<n>Our results highlight that fully exploiting the capabilities of a single interaction can yield a comprehensive and highly accurate gate set.
  arXiv  Detail & Related papers  (2025-02-05T21:00: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)
• Unified framework for efficiently computable quantum circuits [0.0]
  Quantum circuits consisting of Clifford and matchgates are two classes of circuits that are known to be efficiently simulatable on a classical computer. We introduce a unified framework that shows in a transparent way the special structure that allows these circuits can be efficiently simulatable.
  arXiv  Detail & Related papers  (2024-01-16T08:04:28Z)
• Hungarian Qubit Assignment for Optimized Mapping of Quantum Circuits on Multi-Core Architectures [1.1288814203214292]
  Quantum computers are expected to adopt a modular approach, featuring clusters of tightly connected quantum bits with sparser connections between these clusters. Efficiently distributing qubits across multiple processing cores is critical for improving quantum computing systems' performance and scalability. We propose the Hungarian Qubit Assignment (HQA) algorithm, which leverages the Hungarian algorithm to improve qubit-to-core assignment.
  arXiv  Detail & Related papers  (2023-09-21T15:48:45Z)
• Majorization-based benchmark of the complexity of quantum processors [105.54048699217668]
  We numerically simulate and characterize the operation of various quantum processors. We identify and assess quantum complexity by comparing the performance of each device against benchmark lines. We find that the majorization-based benchmark holds as long as the circuits' output states have, on average, high purity.
  arXiv  Detail & Related papers  (2023-04-10T23:01:10Z)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• Exploring the role of parameters in variational quantum algorithms [59.20947681019466]
  We introduce a quantum-control-inspired method for the characterization of variational quantum circuits using the rank of the dynamical Lie algebra. A promising connection is found between the Lie rank, the accuracy of calculated energies, and the requisite depth to attain target states via a given circuit architecture.
  arXiv  Detail & Related papers  (2022-09-28T20:24:53Z)
• Automatic and effective discovery of quantum kernels [41.61572387137452]
  Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data.<n>We present an approach to this problem, which employs optimization techniques, similar to those used in neural architecture search and AutoML.<n>The results obtained by testing our approach on a high-energy physics problem demonstrate that, in the best-case scenario, we can either match or improve testing accuracy with respect to the manual design approach.
  arXiv  Detail & Related papers  (2022-09-22T16:42:14Z)
• 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)
• Optimized Low-Depth Quantum Circuits for Molecular Electronic Structure using a Separable Pair Approximation [0.0]
  We present a classically solvable model that leads to optimized low-depth quantum circuits leveraging separable pair approximations. The obtained circuits are well suited as a baseline circuit for emerging quantum hardware and can, in the long term, provide significantly improved initial states for quantum algorithms.
  arXiv  Detail & Related papers  (2021-05-09T05:10:59Z)

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.