Optimal compression of constrained quantum time evolution

• URL: http://arxiv.org/abs/2311.06347v3
• Date: Sat, 18 May 2024 21:54:50 GMT
• Title: Optimal compression of constrained quantum time evolution
• Abstract summary: Time evolution of quantum many-body systems is one of the most promising applications for near-term quantum computers. In this work, we demonstrate a simplification of the variational optimization of circuits implementing the time evolution operator of local Hamiltonians. Our results show that the encoding of constraints allows a reduction of optimization cost by more than one order of magnitude and scalability to arbitrary large system sizes.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The time evolution of quantum many-body systems is one of the most promising applications for near-term quantum computers. However, the utility of current quantum devices is strongly hampered by the proliferation of hardware errors. The minimization of the circuit depth for a given quantum algorithm is therefore highly desirable, since shallow circuits generally are less vulnerable to decoherence. Recently, it was shown that variational circuits are a promising approach to outperform current state-of-the-art methods such as Trotter decomposition, although the optimal choice of parameters is a computationally demanding task. In this work, we demonstrate a simplification of the variational optimization of circuits implementing the time evolution operator of local Hamiltonians by directly encoding constraints of the physical system under consideration. We study the expressibility of such constrained variational circuits for different models and constraints. Our results show that the encoding of constraints allows a reduction of optimization cost by more than one order of magnitude and scalability to arbitrary large system sizes, without loosing accuracy in most systems. Furthermore, we discuss the exceptions in locally-constrained systems and provide an explanation by means of an restricted lightcone width after incorporating the constraints into the circuits.

Related papers

• Toward Quantum Advantage in Learning Parities with Structured Noise via Lower Bound Optimization of the Condition Number [6.045942774425782]
  Learning Parities with Structured Noise can be reduced to solving nonlinear Boolean systems.<n>In quantum computing, such systems are typically transformed into Macaulay linear systems.<n>We propose a novel reduction method for Macaulay linear systems.
  arXiv  Detail & Related papers  (2026-08-19T17:17:31Z)
• A Variational Surrogate Approach to Finite-Horizon Quantum Control via Hardware-Efficient Ansatz [2.033424698590539]
  We present a variational quantum framework for finite-horizon quantum control based on hardware-efficient anstze.<n>The objective is to steer a quantum system from a given initial state to a desired target state over a fixed time horizon by minimizing a terminal cost defined in terms of state fidelity.
  arXiv  Detail & Related papers  (2026-07-14T14:17:02Z)
• Depth Optimization of Ansatz Circuits for Variational Quantum Algorithms [2.3220521366735247]
  The increasing depth of quantum circuits presents a major limitation for the execution of quantum algorithms.<n>We show that their depth can be reduced by introducing additional qubits, mid-circuit measurements, and classically controlled operations.<n>In particular, we show that the proposed non-unitary quantum circuits can efficiently represent fluid flow configurations in both laminar and turbulent regimes.
  arXiv  Detail & Related papers  (2025-11-17T11:14:14Z)
• Optimization Driven Quantum Circuit Reduction [20.697821016522358]
  We propose three different transpilation approaches to substantially reduce circuit lengths without affecting functionality. The first variant is based on a search scheme, and the other variants are driven by a database retrieval scheme and a machine learning based decision support. We show that our proposed methods generate short quantum circuits for restricted gate sets, superior to the typical results obtained by using different qiskit optimization levels.
  arXiv  Detail & Related papers  (2025-02-20T16:41:10Z)
• Feedback-Based Quantum Strategies for Constrained Combinatorial Optimization Problems [0.6554326244334868]
  We extend the feedback-based quantum algorithms framework to address a broader class of constraints known as invalid configuration (IC) constraints. We propose an alternative method tailored for feedback-based quantum algorithms that directly tackles IC constraints without requiring slack variables. These methods eliminate the need for slack variables, significantly reducing the quantum circuit depth and the number of qubits required.
  arXiv  Detail & Related papers  (2025-02-20T08:57:28Z)
• Inductive Construction of Variational Quantum Circuit for Constrained Combinatorial Optimization [1.8775413720750924]
  We propose a new method for constrained optimization using variational quantum circuits. The proposed method was applied to facility location problem and was found to increase the probability for measuring feasible solutions or optimal solutions.
  arXiv  Detail & Related papers  (2025-01-07T04:35:27Z)
• 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)
• Scaling Up the Quantum Divide and Conquer Algorithm for Combinatorial Optimization [0.8121127831316319]
  We propose a method for constructing quantum circuits which greatly reduces inter-device communication costs. We show that we can construct tractable circuits nearly three times the size of previous QDCA methods while retaining a similar or greater level of quality.
  arXiv  Detail & Related papers  (2024-05-01T20:49:50Z)
• Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
  Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems. In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems. We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
  arXiv  Detail & Related papers  (2024-04-17T11:00:12Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Hardness of braided quantum circuit optimization in the surface code [0.1759008116536278]
  Large-scale quantum information processing requires the use of quantum error codes to mitigate the effects of noise in quantum devices. Topological error-correcting codes, such as surface codes, are promising candidates as they can be implemented using only local interactions in a two-dimensional array of physical qubits. However, error correction also introduces a significant overhead in time, the number of physical qubits, and the number of physical gates.
  arXiv  Detail & Related papers  (2023-02-01T06:35:50Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Fundamental limitations on optimization in variational quantum algorithms [7.165356904023871]
  A leading paradigm to establish such near-term quantum applications is variational quantum algorithms (VQAs) We prove that for a broad class of such random circuits, the variation range of the cost function vanishes exponentially in the number of qubits with a high probability. This result can unify the restrictions on gradient-based and gradient-free optimizations in a natural manner and reveal extra harsh constraints on the training landscapes of VQAs.
  arXiv  Detail & Related papers  (2022-05-10T17:14:57Z)
• Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
  We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most. We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
  arXiv  Detail & Related papers  (2022-04-12T19:39:31Z)
• Ultrafast Holonomic Quantum Gates [4.354697470999286]
  We propose a nonadiabatic holonomic quantum scheme with detuned interactions on $Delta$-type three-level system. Our numerical simulations show that the gate robustness is also stronger than previous schemes. We present an implementation of our proposal on superconducting quantum circuits, with a decoherence-free subspace encoding.
  arXiv  Detail & Related papers  (2021-08-03T14:31:38Z)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• Space-efficient binary optimization for variational computing [68.8204255655161]
  We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem. We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
  arXiv  Detail & Related papers  (2020-09-15T18:17:27Z)

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.