Studies of properties of bipartite graphs with quantum programming
From MaRDI portal
Cites work
- Correlations and projective measurements in maximally entangled multipartite states
- Demonstration of entanglement purification and swapping protocol to design quantum repeater in IBM quantum computer
- Detecting entanglement by the mean value of spin on a quantum computer
- Entanglement in eight-qubit graph states
- Entanglement of graph states of spin system with Ising interaction and its quantifying on IBM's quantum computer
- Entanglement of multi-qubit states representing directed networks and its detection with quantum computing
- Experimental quantum teleportation
- Geometric properties of evolutionary graph states and their detection on a quantum computer
- Graph states for quantum secret sharing
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- Method for direct detection of quantum entanglement
- Multiparty entanglement in graph states
- Quantum cryptography based on Bell’s theorem
- Quantum entanglement
- Recovering entanglement by local operations
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
- Universal Quantum Simulators
This page was built for publication: Studies of properties of bipartite graphs with quantum programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6867319)
