Natural parameterized quantum circuit

• URL: http://arxiv.org/abs/2107.14063v3
• Date: Fri, 25 Nov 2022 11:32:08 GMT
• Title: Natural parameterized quantum circuit
• Authors: Tobias Haug, M. S. Kim
• Abstract summary: We introduce the natural parameterized quantum circuit (NPQC) that can be initialised with a Euclidean quantum geometry. For a general class of quantum circuits, the NPQC has the minimal quantum Cram'er-Rao bound. Our results can be used to enhance currently available quantum processors.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Noisy intermediate scale quantum computers are useful for various tasks such as state preparation and variational quantum algorithms. However, the non-Euclidean quantum geometry of parameterized quantum circuits is detrimental for these applications. Here, we introduce the natural parameterized quantum circuit (NPQC) that can be initialised with a Euclidean quantum geometry. The initial training of variational quantum algorithms is substantially sped up as the gradient is equivalent to the quantum natural gradient. Further, we show how to estimate the parameters of the NPQC by sampling the circuit, which could be used for benchmarking or calibrating NISQ hardware. For a general class of quantum circuits, the NPQC has the minimal quantum Cram\'er-Rao bound which highlights its potential for quantum metrology. Finally, we show how to generate arbitrary superpositions of two states with the NPQCs for state preparation tasks. Our results can be used to enhance currently available quantum processors.

Related papers

• SuperEncoder: Towards Universal Neural Approximate Quantum State Preparation [12.591173729459427]
  We show that it is possible to leverage a pre-trained neural network to directly generate the QSP circuit for arbitrary quantum state. Our study makes a steady step towards a universal neural designer for approximate QSP.
  arXiv  Detail & Related papers  (2024-08-10T04:39:05Z)
• Non-unitary Coupled Cluster Enabled by Mid-circuit Measurements on Quantum Computers [37.69303106863453]
  We propose a state preparation method based on coupled cluster (CC) theory, which is a pillar of quantum chemistry on classical computers. Our approach leads to a reduction of the classical computation overhead, and the number of CNOT and T gates by 28% and 57% on average.
  arXiv  Detail & Related papers  (2024-06-17T14:10:10Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• Reductive Quantum Phase Estimation [0.0]
  We show a circuit that distinguishes an arbitrary set of phases with a fewer number of qubits and unitary applications. We show a trade-off between measurement precision and phase distinguishability, which allows one to tune the circuit to be optimal for a specific application.
  arXiv  Detail & Related papers  (2024-02-06T23:38:36Z)
• 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)
• Assisted quantum simulation of open quantum systems [0.0]
  We introduce the quantum-assisted quantum algorithm, which reduces the circuit depth of UQA via NISQ technology. We present two quantum-assisted quantum algorithms for simulating open quantum systems.
  arXiv  Detail & Related papers  (2023-02-26T11:41:02Z)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• An Amplitude-Based Implementation of the Unit Step Function on a Quantum Computer [0.0]
  We introduce an amplitude-based implementation for approximating non-linearity in the form of the unit step function on a quantum computer. We describe two distinct circuit types which receive their input either directly from a classical computer, or as a quantum state when embedded in a more advanced quantum algorithm.
  arXiv  Detail & Related papers  (2022-06-07T07:14:12Z)
• An Introduction to Quantum Machine Learning for Engineers [36.18344598412261]
  Quantum machine learning is emerging as a dominant paradigm to program gate-based quantum computers. This book provides a self-contained introduction to quantum machine learning for an audience of engineers with a background in probability and linear algebra.
  arXiv  Detail & Related papers  (2022-05-11T12:10:52Z)
• Quantum Neuron with Separable-State Encoding [0.0]
  It is not yet possible to test advanced quantum neuron models on a large scale in currently available quantum processors. We propose a quantum perceptron (QP) model that uses a reduced number of multi-qubit gates. We demonstrate the performance of the proposed model by implementing a few qubits version of the QP in a simulated quantum computer.
  arXiv  Detail & Related papers  (2022-02-16T19:26:23Z)
• Quantum walk processes in quantum devices [55.41644538483948]
  We study how to represent quantum walk on a graph as a quantum circuit. Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
  arXiv  Detail & Related papers  (2020-12-28T18:04:16Z)

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.