SEPARABILITY OF PURE N-QUBIT STATES: TWO CHARACTERIZATIONS
From MaRDI portal
Publication:5696939
DOI10.1142/S0129054103002035zbMath1111.68454arXivquant-ph/0209125MaRDI QIDQ5696939
Mehdi Mhalla, Philippe Jorrand
Publication date: 19 October 2005
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0209125
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)
Related Items (2)
De-quantisation of the quantum Fourier transform ⋮ The Deutsch-Jozsa problem: de-quantisation and entanglement
Cites Work
- Unnamed Item
- The generalized partial transposition criterion for separability of multipartite quantum states
- Separability of mixed states: necessary and sufficient conditions.
- Separability criterion and inseparable mixed states with positive partial transposition.
- Quantum Entanglement and Communication Complexity
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- A separability criterion for density operators
- Quantum cryptography based on Bell’s theorem
- 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
- Separability Criterion for Density Matrices
- Characterizing entanglement
- Quantum states with Einstein-Podolsky-Rosen correlations admitting a hidden-variable model
This page was built for publication: SEPARABILITY OF PURE N-QUBIT STATES: TWO CHARACTERIZATIONS