Optimized search for complex protocols based on entanglement detection

DOI10.1007/s11128-022-03550-5OpenAlexW4283455273MaRDI QIDQ2101216

El Hillali Kerkouche, Khaled Khalfaoui, Allaoua Chaoui, Tahar Boudjedaa

Publication date: 5 December 2022

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11128-022-03550-5

zbMATH Keywords

quantum entanglementoptimization constraintsautomatic explorationcomplex protocols

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum coherence, entanglement, quantum correlations (81P40)

Related Items (1)

Optimized exploration of quantum circuits space based on sub-circuits equivalences

Cites Work

• Bidirectional teleportation of a pure EPR state by using GHZ states
• Generalized concurrence measure for faithful quantification of multiparticle pure state entanglement using Lagrange's identity and wedge product
• Multiparty mediated quantum secret sharing protocol
• A universal protocol for controlled bidirectional quantum state transmission
• Quantum double-direction cyclic controlled communication via a thirteen-qubit entangled state
• Upperbounds on the probability of finding marked connected components using quantum walks
• The phase matching quantum key distribution protocol with 3-state systems
• Bidirectional teleportation using coherent states
• Automatic design of quantum circuits. Generation of quantum teleportation protocols
• Quantum Computation and Quantum Information
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
• Quantifying parallelism of vectors is the quantification of distributedn-party entanglement
• Computing quantum discord is NP-complete

This page was built for publication: Optimized search for complex protocols based on entanglement detection