Clique detection using symmetry-restricted quantum circuits

• URL: http://arxiv.org/abs/2506.03339v2
• Date: Mon, 16 Jun 2025 08:16:29 GMT
• Title: Clique detection using symmetry-restricted quantum circuits
• Authors: Maximilian Balthasar Mansky, Tobias Rohe, Dmytro Bondarenko, Linus Menzel, Claudia Linnhoff-Popien,
• Abstract summary: We show the application of permutation-invariant quantum circuits to the clique problem.<n>The experiment asks to label a clique through identification of the nodes in a larger subgraph.
• Score: 4.180897432770239
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We show the application of permutation-invariant quantum circuits to the clique problem. The experiment asks to label a clique through identification of the nodes in a larger subgraph. The permutation-invariant quantum circuit outperforms a cyclic-invariant alternative as well as a standard quantum machine learning ansatz. We explain the behavior through the intrinsic symmetry of the problem, in the sense that the problem is symmetric under permutation of both the feature and the label.

Related papers

• Solving graph problems using permutation-invariant quantum machine learning [35.99391901074448]
  In quantum machine learning, the ansatz can be tuned to correspond to the specific symmetry of the problem.<n>We show how the symmetry can be included in the quantum circuit in a straightforward constructive method.
  arXiv  Detail & Related papers  (2025-05-19T06:44:03Z)
• Geometric Quantum Machine Learning with Horizontal Quantum Gates [41.912613724593875]
  We propose an alternative paradigm for the symmetry-informed construction of variational quantum circuits. We achieve this by introducing horizontal quantum gates, which only transform the state with respect to the directions to those of the symmetry. For a particular subclass of horizontal gates based on symmetric spaces, we can obtain efficient circuit decompositions for our gates through the KAK theorem.
  arXiv  Detail & Related papers  (2024-06-06T18:04:39Z)
• Permutation-invariant quantum circuits [4.900041609957432]
  We show the integration of the permutation symmetry as the most restrictive discrete symmetry into quantum circuits. The scaling of the number of parameters is found to be $mathcalO(n3)$, significantly lower than the general case.
  arXiv  Detail & Related papers  (2023-12-22T18:42:48Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• One-Way Ticket to Las Vegas and the Quantum Adversary [78.33558762484924]
  We show that quantum Las Vegas query complexity is exactly equal to the quantum adversary bound. This is achieved by transforming a feasible solution to the adversary inversion problem into a quantum query algorithm.
  arXiv  Detail & Related papers  (2023-01-05T11:05:22Z)
• Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
  We study the problem of designing worst-case to average-case reductions for quantum algorithms. We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
  arXiv  Detail & Related papers  (2022-12-06T22:01:49Z)
• Parameterized Two-Qubit Gates for Enhanced Variational Quantum Eigensolver [0.0]
  We simulate a variational quantum eigensolver algorithm using fixed and parameterized two-qubit gates in the circuit ansatz. We show that the parameterized versions outperform the fixed versions, both when it comes to best energy and reducing outliers, for a range of Hamiltonians with applications in quantum chemistry and materials science.
  arXiv  Detail & Related papers  (2022-03-09T19:00:01Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• Quantum information spreading in a disordered quantum walk [50.591267188664666]
  We design a quantum probing protocol using Quantum Walks to investigate the Quantum Information spreading pattern. We focus on the coherent static and dynamic disorder to investigate anomalous and classical transport. Our results show that a Quantum Walk can be considered as a readout device of information about defects and perturbations occurring in complex networks.
  arXiv  Detail & Related papers  (2020-10-20T20:03:19Z)
• Reducing the amount of single-qubit rotations in VQE and related algorithms [0.0]
  We show that the number of single-qubit rotations in parameterized quantum circuits can be decreased without compromising the relative expressibility or entangling capability of the circuit. We also show that the performance of a variational quantum eigensolver is unaffected by a similar decrease in single-qubit rotations.
  arXiv  Detail & Related papers  (2020-05-27T18:00:01Z)

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.