Reductive Quantum Phase Estimation

• URL: http://arxiv.org/abs/2402.04471v4
• Date: Thu, 11 Jul 2024 17:31:49 GMT
• Title: Reductive Quantum Phase Estimation
• Authors: Nicholas J. C. Papadopoulos, Jarrod T. Reilly, John Drew Wilson, Murray J. Holland,
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Estimating a quantum phase is a necessary task in a wide range of fields of quantum science. To accomplish this task, two well-known methods have been developed in distinct contexts, namely, Ramsey interferometry (RI) in atomic and molecular physics and quantum phase estimation (QPE) in quantum computing. We demonstrate that these canonical examples are instances of a larger class of phase estimation protocols, which we call reductive quantum phase estimation (RQPE) circuits. Here we present an explicit algorithm that allows one to create an RQPE circuit. This circuit distinguishes an arbitrary set of phases with a fewer number of qubits and unitary applications, thereby solving a general class of quantum hypothesis testing to which RI and QPE belong. We further demonstrate a trade-off between measurement precision and phase distinguishability, which allows one to tune the circuit to be optimal for a specific application.

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)
• 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)
• A quantum implementation of high-order power method for estimating geometric entanglement of pure states [39.58317527488534]
  This work presents a quantum adaptation of the iterative higher-order power method for estimating the geometric measure of entanglement of multi-qubit pure states. It is executable on current (hybrid) quantum hardware and does not depend on quantum memory. We study the effect of noise on the algorithm using a simple theoretical model based on the standard depolarising channel.
  arXiv  Detail & Related papers  (2024-05-29T14:40:24Z)
• Single-Round Proofs of Quantumness from Knowledge Assumptions [41.94295877935867]
  A proof of quantumness is an efficiently verifiable interactive test that an efficient quantum computer can pass. Existing single-round protocols require large quantum circuits, whereas multi-round ones use smaller circuits but require experimentally challenging mid-circuit measurements. We construct efficient single-round proofs of quantumness based on existing knowledge assumptions.
  arXiv  Detail & Related papers  (2024-05-24T17:33:10Z)
• 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. We analyse the generation of random states in PQCs under restrictions on the qubits connectivities. 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)
• 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)
• Simultaneous estimation of multiple eigenvalues with short-depth quantum circuit on early fault-tolerant quantum computers [5.746732081406236]
  We introduce a multi-modal, multi-level quantum complex exponential least squares (MM-QCELS) method to simultaneously estimate multiple eigenvalues of a quantum Hamiltonian on early fault-tolerant quantum computers. Our theoretical analysis demonstrates that the algorithm exhibits Heisenberg-limited scaling in terms of circuit depth and total cost.
  arXiv  Detail & Related papers  (2023-03-10T05:42:26Z)
• Quantum Computation of Phase Transition in Interacting Scalar Quantum Field Theory [0.0]
  It has been demonstrated that the critical point of the phase transition in scalar quantum field theory can be approximated via a Gaussian Effective Potential (GEP) We perform quantum computations with various lattice sizes and obtain evidence of a transition from a symmetric to a symmetry-broken phase. We implement the ten-site case on IBM quantum hardware using the Variational Quantum Eigensolver (VQE) algorithm to minimize the GEP.
  arXiv  Detail & Related papers  (2023-03-04T14:11:37Z)
• Natural parameterized quantum circuit [0.0]
  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.
  arXiv  Detail & Related papers  (2021-07-29T14:54:04Z)
• Fast Swapping in a Quantum Multiplier Modelled as a Queuing Network [64.1951227380212]
  We propose that quantum circuits can be modeled as queuing networks. Our method is scalable and has the potential speed and precision necessary for large scale quantum circuit compilation.
  arXiv  Detail & Related papers  (2021-06-26T10:55:52Z)
• Minimizing estimation runtime on noisy quantum computers [0.0]
  "engineered likelihood function" (ELF) is used for carrying out Bayesian inference. We show how the ELF formalism enhances the rate of information gain in sampling as the physical hardware transitions from the regime of noisy quantum computers. This technique speeds up a central component of many quantum algorithms, with applications including chemistry, materials, finance, and beyond.
  arXiv  Detail & Related papers  (2020-06-16T17:46:18Z)

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.