Implementation of a general single-qubit positive operator-valued measure on a circuit-based quantum computer

• URL: http://arxiv.org/abs/2001.04749v1
• Date: Tue, 14 Jan 2020 12:50:50 GMT
• Title: Implementation of a general single-qubit positive operator-valued measure on a circuit-based quantum computer
• Authors: Yordan S. Yordanov and Crispin H. W. Barnes
• Abstract summary: We derive a protocol to implement a general single-qubit POVM on near-term circuit-based quantum computers. We use the protocol to implement $2$- and $3$-element POVMs on two publicly available quantum computing devices.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We derive a deterministic protocol to implement a general single-qubit POVM on near-term circuit-based quantum computers. The protocol has a modular structure, such that an $n$-element POVM is implemented as a sequence of $(n-1)$ circuit modules. Each module performs a $2$-element POVM. Two variations of the protocol are suggested, one optimal in terms of number of ancilla qubits, the other optimal in terms of number of qubit gate operations and quantum circuit depth. We use the protocol to implement $2$- and $3$-element POVMs on two publicly available quantum computing devices. The results we obtain suggest that implementing non-trivial POVMs could be within the reach of the current noisy quantum computing devices.

Related papers

• SWAP-less Implementation of Quantum Algorithms [0.0]
  We present a formalism based on tracking the flow of parity quantum information to implement algorithms on devices with limited connectivity. We leverage the fact that entangling gates not only manipulate quantum states but can also be exploited to transport quantum information.
  arXiv  Detail & Related papers  (2024-08-20T14:51:00Z)
• Arbitrary quantum circuits on a fully integrated two-qubit computation register for a trapped-ion quantum processor [0.0]
  We report on the implementation of arbitrary circuits on a universal two-qubit register that can act as the computational module in a trapped-ion quantum computer. A universal set of quantum gates is implemented on a two-ion Coulomb crystal of $9$Be$+$ ions using only chip-integrated microwave addressing.
  arXiv  Detail & Related papers  (2024-03-28T19:44:18Z)
• On sampling determinantal and Pfaffian point processes on a quantum computer [49.1574468325115]
  DPPs were introduced by Macchi as a model in quantum optics the 1970s. Most applications require sampling from a DPP, and given their quantum origin, it is natural to wonder whether sampling a DPP on a classical computer is easier than on a classical one. Vanilla sampling consists in two steps, of respective costs $mathcalO(N3)$ and $mathcalO(Nr2)$ operations on a classical computer, where $r$ is the rank of the kernel matrix.
  arXiv  Detail & Related papers  (2023-05-25T08:43:11Z)
• Multi-User Entanglement Distribution in Quantum Networks Using Multipath Routing [55.2480439325792]
  We propose three protocols that increase the entanglement rate of multi-user applications by leveraging multipath routing. The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation.
  arXiv  Detail & Related papers  (2023-03-06T18:06:00Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• Ancilla-free implementation of generalized measurements for qubits embedded in a qudit space [1.4680035572775534]
  We show how to implement a general class of IC-POVMs without ancilla qubits. We exploit the higher-dimensional Hilbert space of a qudit in which qubits are often encoded. We develop the required control pulse sequences and numerically establish their feasibility for superconducting transmon qubits.
  arXiv  Detail & Related papers  (2022-03-14T17:59:59Z)
• Quantum circuit compilation and hybrid computation using Pauli-based computation [0.0]
  Pauli-based computation (PBC) is driven by a sequence of adaptively chosen, non-destructive measurements of Pauli observables. We propose practical ways of implementing PBC as adaptive quantum circuits and provide code to do the required classical side-processing.
  arXiv  Detail & Related papers  (2022-03-03T16:01:55Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Optimal State Transfer and Entanglement Generation in Power-law Interacting Systems [0.5592394503914488]
  We present an optimal protocol for encoding an unknown qubit state into a multiqubit Greenberger-Horne-Zeilinger-like state. The protocol has a wide range of applications, including in quantum sensing, quantum computing, and preparation of topologically ordered states.
  arXiv  Detail & Related papers  (2020-10-06T18:00:02Z)
• Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
  We study two different methods to prepare excited states on a quantum computer. We benchmark these techniques on emulated and real quantum devices. These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
  arXiv  Detail & Related papers  (2020-09-28T17:21:25Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.