Quantum Algorithm for Quantum State Discrimination via Partial Negation and Weak Measurement

• URL: http://arxiv.org/abs/2102.11945v1
• Date: Tue, 23 Feb 2021 21:18:19 GMT
• Title: Quantum Algorithm for Quantum State Discrimination via Partial Negation and Weak Measurement
• Authors: Doha A. Rizk, Ahmed Younes
• Abstract summary: A quantum algorithm using weak measurement and partial negation will be proposed to solve the quantum state discrimination problem. The proposed algorithm will be able to determine, with high probability of success, the state of the unknown qubit.
• Score: 1.2691047660244335
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The quantum state discrimination problem is to distinguish between non-orthogonal quantum states. This problem has many applications in quantum information theory, quantum communication and quantum cryptography. In this paper a quantum algorithm using weak measurement and partial negation will be proposed to solve the quantum state discrimination problem using a single copy of an unknown qubit. The usage of weak measurement makes it possible to reconstruct the qubit after measurement since the superposition will not be destroyed due to measurement. The proposed algorithm will be able to determine, with high probability of success, the state of the unknown qubit and whether it is encoded in the Hadamard or the computational basis by counting the outcome of the successive measurements on an auxiliary qubit.

Related papers

• Realizing fracton order from long-range quantum entanglement in programmable Rydberg atom arrays [45.19832622389592]
  Storing quantum information requires battling quantum decoherence, which results in a loss of information over time. To achieve error-resistant quantum memory, one would like to store the information in a quantum superposition of degenerate states engineered in such a way that local sources of noise cannot change one state into another. We show that this platform also allows to detect and correct certain types of errors en route to the goal of true error-resistant quantum memory.
  arXiv  Detail & Related papers  (2024-07-08T12:46:08Z)
• Quantum quench dynamics as a shortcut to adiabaticity [31.114245664719455]
  We develop and test a quantum algorithm in which the incorporation of a quench step serves as a remedy to the diverging adiabatic timescale. Our experiments show that this approach significantly outperforms the adiabatic algorithm.
  arXiv  Detail & Related papers  (2024-05-31T17:07:43Z)
• Randomly Monitored Quantum Codes [8.557392136621894]
  Recent studies have shown that quantum measurement itself can induce novel quantum phenomena. One example is a monitored random circuit, which can generate long-range entanglement faster than a random unitary circuit. In particular, we demonstrate that for a large class of quantum error-correcitng codes, it is impossible to destroy the encoded information through random single-qubit Pauli measurements.
  arXiv  Detail & Related papers  (2024-01-31T19:53:06Z)
• Power Characterization of Noisy Quantum Kernels [52.47151453259434]
  We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small. We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
  arXiv  Detail & Related papers  (2024-01-31T01:02:16Z)
• Quantum State Tomography for Matrix Product Density Operators [28.799576051288888]
  Reconstruction of quantum states from experimental measurements is crucial for the verification and benchmarking of quantum devices. Many physical quantum states, such as states generated by noisy, intermediate-scale quantum computers, are usually structured. We establish theoretical guarantees for the stable recovery of MPOs using tools from compressive sensing and the theory of empirical processes.
  arXiv  Detail & Related papers  (2023-06-15T18:23:55Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Finite-round quantum error correction on symmetric quantum sensors [8.339831319589134]
  Heisenberg limit provides a quadratic improvement over the standard quantum limit. It remains elusive because of the inevitable presence of noise decohering quantum sensors. We side-step this no-go result by using an optimal finite number of rounds of quantum error correction.
  arXiv  Detail & Related papers  (2022-12-12T23:41:51Z)
• Quantum tomography of noisy ion-based qudits [0.0]
  We show that it is possible to construct a quantum measurement protocol that contains no more than a single quantum operation in each measurement circuit. The measures described can significantly improve the accuracy of quantum tomography of real ion-based qudits.
  arXiv  Detail & Related papers  (2020-11-09T04:10:32Z)
• Maximal entropy approach for quantum state tomography [3.6344381605841187]
  Current quantum computing devices are noisy intermediate-scale quantum $($NISQ$)$ devices. Quantum tomography tries to reconstruct a quantum system's density matrix by a complete set of observables. We propose an alternative approach to quantum tomography, based on the maximal information entropy, that can predict the values of unknown observables.
  arXiv  Detail & Related papers  (2020-09-02T04:39:45Z)
• Arbitrary Measurement on Any Real-valued Probability Amplitude in Any Quantum System [0.0]
  One novel quantum measurement scheme is proposed to solve these questions based on the idea of binary searching. The proposed quantum measurement scheme has the performance in quantum information processing with twofold advantages: separable measurement and exponential speed up.
  arXiv  Detail & Related papers  (2020-08-31T09:56:07Z)
• An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
  We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem. The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
  arXiv  Detail & Related papers  (2020-05-06T14:18:44Z)

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.