Global versus local quantum correlations in the Grover search algorithm
From MaRDI portal
Publication:264626
DOI10.1007/s11128-015-1174-yzbMath1333.81097OpenAlexW2174122768WikidataQ62554344 ScholiaQ62554344MaRDI QIDQ264626
Ahmed Farouk, M. S. Alkhambashi, C. H. Raymond Ooi, Soliman Abdalla, Josep Batle
Publication date: 1 April 2016
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-015-1174-y
Related Items
Do multipartite correlations speed up adiabatic quantum computation or quantum annealing? ⋮ Entangling and disentangling in Grover's search algorithm ⋮ Entanglement in phase estimation algorithm and quantum counting algorithm ⋮ Mermin polynomials for non-locality and entanglement detection in Grover's algorithm and quantum Fourier transform ⋮ Global multipartite entanglement dynamics in Grover's search algorithm ⋮ Towards implementation of a generalized architecture for high-level quantum programming language ⋮ Grover's algorithm and the secant varieties
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Entanglement in the Grover search algorithm
- Quantum analogues of the Bell inequalities. The case of two spatially separated domains
- Bell inequality, Bell states and maximally entangled states for \(n\) qubits
- Bell-Type Inequalities for Partial Separability in<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mi>N</mml:mi></mml:math>-Particle Systems and Quantum Mechanical Violat
- Information and computation: Classical and quantum aspects
- Nonlocality and entanglement in qubit systems
- Nonlocality of cluster states of qubits
- Thermal entanglement between alternate qubits of a four-qubit Heisenberg<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mrow><mml:mi>X</mml:mi><mml:mi>X</mml:mi></mml:mrow></mml:math>chain in a magnetic field
- Correlations in the Grover search
- Monogamy of non-local quantum correlations
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- A relevant two qubit Bell inequality inequivalent to the CHSH inequality
- Extreme quantum entanglement in a superposition of macroscopically distinct states
- Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
- Introduction to Quantum Computation and Information
- Searching for highly entangled multi-qubit states
- Global entanglement in multiparticle systems
- Entanglement Generation of Nearly Random Operators
- Proposed Experiment to Test Local Hidden-Variable Theories
