Mermin polynomials for non-locality and entanglement detection in Grover's algorithm and quantum Fourier transform
From MaRDI portal
Publication:2687188
DOI10.1007/s11128-020-02976-zOpenAlexW3135129529MaRDI QIDQ2687188
Hamza Jaffali, Frédéric Holweck, Alain Giorgetti, Henri de Boutray, Pierre-Alain Masson
Publication date: 1 March 2023
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.05192
entanglementquantum Fourier transformnon-localityGrover's quantum search algorithmMABK violationMermin polynomialsquantum programs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global versus local quantum correlations in the Grover search algorithm
- Grover's algorithm and the secant varieties
- How entangled can two couples get?
- Quantum entanglement involved in Grover's and Shor's algorithms: the four-qubit case
- Quantum Computation and Quantum Information
- Quantum algorithms: entanglement–enhanced information processing
- Extreme quantum entanglement in a superposition of macroscopically distinct states
- On the role of entanglement in quantum-computational speed-up
- Global entanglement in multiparticle systems
- On symmetric SL-invariant polynomials in four qubits
- Proposed Experiment to Test Local Hidden-Variable Theories
- ENTANGLEMENT MONOTONES AND MAXIMALLY ENTANGLED STATES IN MULTIPARTITE QUBIT SYSTEMS
- An axiomatic basis for computer programming
