Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 80 tok/s
Gemini 2.5 Pro 60 tok/s Pro
GPT-5 Medium 23 tok/s Pro
GPT-5 High 26 tok/s Pro
GPT-4o 87 tok/s Pro
Kimi K2 173 tok/s Pro
GPT OSS 120B 433 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
2000 character limit reached

A Bottom-up Approach to Constructing Symmetric Variational Quantum Circuits (2308.08912v1)

Published 17 Aug 2023 in quant-ph and cond-mat.str-el

Abstract: In the age of noisy quantum processors, the exploitation of quantum symmetries can be quite beneficial in the efficient preparation of trial states, an important part of the variational quantum eigensolver algorithm. The benefits include building quantum circuits which are more compact, with lesser number of paramaters, and more robust to noise, than their non-symmetric counterparts. Leveraging on ideas from representation theory we show how to construct symmetric quantum circuits. Similar ideas have been previously used in the field of tensor networks to construct symmetric tensor networks. We focus on the specific case of particle number conservation, that is systems with U(1) symmetry. Based on the representation theory of U(1), we show how to derive the particle-conserving exchange gates, which are commonly used in constructing hardware-efficient quantum circuits for fermionic systems, like in quantum chemistry, material science, and condensed-matter physics. We tested the effectiveness of our circuits with the Heisenberg XXZ model.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.