Symmetric quantum computation

• URL: http://arxiv.org/abs/2501.01214v2
• Date: Mon, 06 Oct 2025 17:16:20 GMT
• Title: Symmetric quantum computation
• Authors: Davi Castro-Silva, Tom Gur, Sergii Strelchuk,
• Abstract summary: We introduce a new model of quantum computation that preserves symmetries of the problems it solves.<n>This model is well-adapted for studying the role of symmetry in quantum speedups.<n>We show that symmetric quantum circuits are fundamentally more powerful than their classical counterparts.
• Score: 2.746444760994207
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We introduce a systematic study of "symmetric quantum circuits", a new restricted model of quantum computation that preserves the symmetries of the problems it solves. This model is well-adapted for studying the role of symmetry in quantum speedups, extending a central notion of symmetric computation studied in the classical setting. Our results establish that symmetric quantum circuits are fundamentally more powerful than their classical counterparts. First, we give efficient symmetric circuits for key quantum techniques such as amplitude amplification, phase estimation and linear combination of unitaries. In addition, we show how the task of symmetric state preparation can be performed efficiently in several natural cases. Finally, we demonstrate an exponential separation in the symmetric setting for the problem XOR-SAT, which requires exponential-size symmetric classical circuits but can be solved by polynomial-size symmetric quantum circuits.

Related papers

• Spin-Adapted Fermionic Unitaries: From Lie Algebras to Compact Quantum Circuits [0.013714053458441644]
  We introduce a minimum universal symmetry-adapted operator pool to further reduce the required quantum resources.<n>Conservation of symmetries plays a crucial role in both classical and quantum simulations of many-body systems.
  arXiv  Detail & Related papers  (2025-11-17T15:21:22Z)
• Path integral approach to quantum thermalization [39.25860941747971]
  We introduce a quasiclassical Green function approach describing the unitary yet irreversible dynamics of quantum systems.<n>We show that it is capable of describing a wide range of system classes and disorder models.<n>We present our formalism in a self-contained and pedagogical manner, aiming to provide a transferable toolbox for the first-principles description of many-body chaotic quantum systems.
  arXiv  Detail & Related papers  (2025-09-07T12:10:48Z)
• Predicting symmetries of quantum dynamics with optimal samples [41.42817348756889]
  Identifying symmetries in quantum dynamics is a crucial challenge with profound implications for quantum technologies.<n>We introduce a unified framework combining group representation theory and subgroup hypothesis testing to predict these symmetries with optimal efficiency.<n>We prove that parallel strategies achieve the same performance as adaptive or indefinite-causal-order protocols.
  arXiv  Detail & Related papers  (2025-02-03T15:57:50Z)
• Variational Quantum Subspace Construction via Symmetry-Preserving Cost Functions [39.58317527488534]
  We propose a variational strategy based on symmetry-preserving cost functions to iteratively construct a reduced subspace for extraction of low-lying energy states.<n>As a proof of concept, we test the proposed algorithms on H4 chain and ring, targeting both the ground-state energy and the charge gap.
  arXiv  Detail & Related papers  (2024-11-25T20:33:47Z)
• Unification of Finite Symmetries in Simulation of Many-body Systems on Quantum Computers [2.755415305274264]
  We present a unified framework for incorporating symmetry groups into the simulation of many-body systems on quantum computers. The broad applicability and the efficiency of the proposed symmetry-adapted subroutine holds the promise for exponential speedup in quantum simulation of many-body systems.
  arXiv  Detail & Related papers  (2024-11-07T18:06:16Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Group-invariant estimation of symmetric states generated by noisy quantum computers [0.0]
  We analyze the density matrices of symmetric quantum states generated by a quantum processor. We take advantage of an estimation technique that results to be equivalent to the quantum Maximum Entropy (MaxEnt) estimation. The smart use of prior knowledge of the quantum state symmetries allows for a reduction in both, the number of measurements that need to be made on the system, and the size of the computational problem to store and process the data.
  arXiv  Detail & Related papers  (2024-08-17T12:20:43Z)
• Quantum Algorithms for Realizing Symmetric, Asymmetric, and Antisymmetric Projectors [3.481985817302898]
  Knowing the symmetries of a given system or state obeys or disobeys is often useful in quantum computing. We present a collection of quantum algorithms that realize projections onto the symmetric subspace. We show how projectors can be combined in a systematic way to effectively measure various projections in a single quantum circuit.
  arXiv  Detail & Related papers  (2024-07-24T18:00:07Z)
• Physical consequences of Lindbladian invariance transformations [44.99833362998488]
  We show that symmetry transformations can be exploited, on their own, to optimize practical physical tasks. In particular, we show how they can be used to change the measurable values of physical quantities regarding the exchange of energy and/or information with the environment.
  arXiv  Detail & Related papers  (2024-07-02T18:22:11Z)
• 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)
• Quantum quench dynamics as a shortcut to adiabaticity [31.114245664719455]
  We develop and test a quantum algorithm in which the incorporation of a quench step serves as a remedy to the diverging adiabatic timescale. Our experiments show that this approach significantly outperforms the adiabatic algorithm.
  arXiv  Detail & Related papers  (2024-05-31T17:07:43Z)
• Restoring symmetries in quantum computing using Classical Shadows [0.0]
  We introduce a method to enforce some symmetries starting from a trial wave-function prepared on quantum computers that might not respect these symmetries. We show that the present scheme can be competitive to predict observables on symmetry-restored states once optimization through derandomization is employed.
  arXiv  Detail & Related papers  (2023-11-08T10:11:01Z)
• Efficient quantum algorithms for testing symmetries of open quantum systems [17.55887357254701]
  In quantum mechanics, it is possible to eliminate degrees of freedom by leveraging symmetry to identify the possible physical transitions. Previous works have focused on devising quantum algorithms to ascertain symmetries by means of fidelity-based symmetry measures. We develop alternative symmetry testing quantum algorithms that are efficiently implementable on quantum computers.
  arXiv  Detail & Related papers  (2023-09-05T18:05:26Z)
• Efficient estimation of trainability for variational quantum circuits [43.028111013960206]
  We find an efficient method to compute the cost function and its variance for a wide class of variational quantum circuits. This method can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem.
  arXiv  Detail & Related papers  (2023-02-09T14:05:18Z)
• Efficient classical algorithms for simulating symmetric quantum systems [4.416367445587541]
  We show that classical algorithms can efficiently emulate quantum counterparts given certain classical descriptions of the input. Specifically, we give classical algorithms that calculate ground states and time-evolved expectation values for permutation-invariantians specified in the symmetrized Pauli basis.
  arXiv  Detail & Related papers  (2022-11-30T13:53:16Z)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• Symmetric Pruning in Quantum Neural Networks [111.438286016951]
  Quantum neural networks (QNNs) exert the power of modern quantum machines. QNNs with handcraft symmetric ansatzes generally experience better trainability than those with asymmetric ansatzes. We propose the effective quantum neural tangent kernel (EQNTK) to quantify the convergence of QNNs towards the global optima.
  arXiv  Detail & Related papers  (2022-08-30T08:17:55Z)
• 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)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)

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.