Arbitrary Measurement on Any Real-valued Probability Amplitude in Any Quantum System

• URL: http://arxiv.org/abs/2008.13458v1
• Date: Mon, 31 Aug 2020 09:56:07 GMT
• Title: Arbitrary Measurement on Any Real-valued Probability Amplitude in Any Quantum System
• Authors: Xu Guanlei
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: How to achieve an arbitrary real-valued probability amplitude in the general single-partite or multipartite quantum system without measuring any other quantum state's probability amplitude? How to achieve an arbitrary real-valued probability amplitude with the deterministic polynomial time's complexity under a small given error? In this paper, one novel quantum measurement scheme is proposed to solve these questions based on the idea of binary searching. First, the measurement algorithm with the exponential speed-up on the quantum state with one single qubit is well-designed. Then, the measurement algorithm is extended to the quantum states in the general multipartite quantum system and the special multipartite quantum system. The theoretical analysis proves that the proposed quantum measurement scheme has the performance in quantum information processing with twofold advantages: separable measurement and exponential speed up.

Related papers

• 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)
• Practical limitations of quantum data propagation on noisy quantum processors [0.9362259192191963]
  We show that owing to the noisy nature of current quantum processors, such a quantum algorithm will require single- and two-qubit gates with very low error probability to produce reliable results. Specifically, we provide the upper bounds on how the relative error in variational parameters' propagation scales with the probability of noise in quantum hardware.
  arXiv  Detail & Related papers  (2023-06-22T17:12:52Z)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• 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)
• Quantum jump metrology in a two-cavity network [0.0]
  In interferometry, quantum physics is used to enhance measurement precision. An alternative approach is quantum metrology jump [L. A. Clark et al., Phys A 99, 022102] which deduces information by continuously monitoring an open quantum system. It is shown that the proposed approach can exceed the standard quantum limit without the need for complex quantum states being scalable.
  arXiv  Detail & Related papers  (2022-01-12T10:53:24Z)
• Stochastic emulation of quantum algorithms [0.0]
  We introduce higher-order partial derivatives of a probability distribution of particle positions as a new object that shares basic properties of quantum mechanical states needed for a quantum algorithm. We prove that the propagation via the map built from those universal maps reproduces up to a prefactor exactly the evolution of the quantum mechanical state. We implement several well-known quantum algorithms, analyse the scaling of the needed number of realizations with the number of qubits, and highlight the role of destructive interference for the cost of emulation.
  arXiv  Detail & Related papers  (2021-09-16T07:54:31Z)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• Preparing random states and benchmarking with many-body quantum chaos [48.044162981804526]
  We show how to predict and experimentally observe the emergence of random state ensembles naturally under time-independent Hamiltonian dynamics. The observed random ensembles emerge from projective measurements and are intimately linked to universal correlations built up between subsystems of a larger quantum system. Our work has implications for understanding randomness in quantum dynamics, and enables applications of this concept in a wider context.
  arXiv  Detail & Related papers  (2021-03-05T08:32:43Z)
• 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)
• Perfect discrimination of quantum measurements using entangled systems [0.0]
  We investigate the problem of single-shot discrimination of quantum measurements using two strategies. One based on single quantum systems and the other one based on entangled quantum systems. We show that any advantage in measurement discrimination tasks over single systems is a demonstration of Einstein-Podolsky-Rosen 'quantum steering'
  arXiv  Detail & Related papers  (2020-12-13T14:30:06Z)
• 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)

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.