On-the-fly Tailoring towards a Rational Ansatz Design for Digital Quantum Simulations

• URL: http://arxiv.org/abs/2302.03405v1
• Date: Tue, 7 Feb 2023 11:22:01 GMT
• Title: On-the-fly Tailoring towards a Rational Ansatz Design for Digital Quantum Simulations
• Authors: Dibyendu Mondal, Sonaldeep Halder, Dipanjali Halder, Rahul Maitra
• Abstract summary: It is imperative to develop low depth quantum circuits that are physically realizable in quantum devices. We develop a disentangled ansatz construction protocol that can dynamically tailor an optimal ansatz. The construction of the ansatz may potentially be performed in parallel quantum architecture through energy sorting and operator commutativity prescreening.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Recent advancements in quantum information and quantum technology has stimulated a good deal of interest in the development of quantum algorithms for energetics and properties of many-fermionic systems. While the variational quantum eigensolver is the most optimal algorithm in the Noisy Intermediate Scale Quantum era, it is imperative to develop low depth quantum circuits that are physically realizable in quantum devices. Within the unitary coupled cluster framework, we develop COMPASS, a disentangled ansatz construction protocol that can dynamically tailor an optimal ansatz using the one and two-body cluster operators and a selection of rank-two scatterers. The construction of the ansatz may potentially be performed in parallel quantum architecture through energy sorting and operator commutativity prescreening. With significant reduction in the circuit depth towards the simulation of molecular strong correlation, COMPASS is shown to be highly accurate and resilient to the noisy circumstances of the near-term quantum hardware.

Related papers

• 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)
• Multi-target quantum compilation algorithm [0.0]
  In quantum computing, quantum compilation involves transforming information from a target unitary into a trainable unitary represented by a quantum circuit. We develop a multi-target quantum compilation algorithm to enhance the performance and flexibility of simulating multiple quantum systems.
  arXiv  Detail & Related papers  (2024-07-01T06:47:24Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• 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)
• Parametric Synthesis of Computational Circuits for Complex Quantum Algorithms [0.0]
  The purpose of our quantum synthesizer is enabling users to implement quantum algorithms using higher-level commands. The proposed approach for implementing quantum algorithms has a potential application in the field of machine learning.
  arXiv  Detail & Related papers  (2022-09-20T06:25:47Z)
• Quantum Neural Architecture Search with Quantum Circuits Metric and Bayesian Optimization [2.20200533591633]
  We propose a new quantum gates distance that characterizes the gates' action over every quantum state. Our approach significantly outperforms the benchmark on three empirical quantum machine learning problems.
  arXiv  Detail & Related papers  (2022-06-28T16:23:24Z)
• Optimal quantum kernels for small data classification [0.0]
  We show an algorithm for constructing quantum kernels for support vector machines that adapts quantum gate sequences to data. The performance of the resulting quantum models for classification problems with a small number of training points significantly exceeds that of optimized classical models.
  arXiv  Detail & Related papers  (2022-03-25T18:26:44Z)
• Feasible Architecture for Quantum Fully Convolutional Networks [4.849886707973093]
  We propose a feasible pure quantum architecture that can be operated on noisy intermediate-scale quantum devices. Our study represents the successful training of a pure quantum fully convolutional network and discusses advantages by comparing it with the hybrid solution.
  arXiv  Detail & Related papers  (2021-10-05T01:06:54Z)
• 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)
• 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)

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.