Symmetric quantum computation

• URL: http://arxiv.org/abs/2501.01214v1
• Date: Thu, 02 Jan 2025 11:54:13 GMT
• Title: Symmetric quantum computation
• Authors: Davi Castro-Silva, Tom Gur, Sergii Strelchuk,
• Abstract summary: "symmetric quantum circuits" are a restricted model of quantum computation where the restriction is symmetry-based. We show that symmetric quantum circuits go beyond the capabilities of their classical counterparts by efficiently implementing key quantum subroutines.
• Score: 2.928964540437144
• License:
• Abstract: We introduce a systematic study of "symmetric quantum circuits", a restricted model of quantum computation where the restriction is symmetry-based. This model is well-adapted for studying the role of symmetries in quantum speedups, and it extends a powerful notion of symmetric computation studied in the classical setting. We show that symmetric quantum circuits go beyond the capabilities of their classical counterparts by efficiently implementing key quantum subroutines such as amplitude amplification and phase estimation, as well as the linear combination of unitaries technique. In addition, we consider the task of symmetric state preparation and show that it can be performed efficiently in several interesting and nontrivial cases.

Related papers

• 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)
• 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)
• 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.