相关论文: Quantum Entanglement and Quantum Computational Alg…
We propose the necessary and sufficient condition for the presence of quantum entanglement in arbitrary symmetric pure states of two-level atomic systems. We introduce a parameter to quantify quantum entanglement in such systems. We express…
We numerically analyze the dynamical generation of quantum entanglement in a system of 2 interacting particles, started in a coherent separable state, for decreasing values of $\hbar$. As $\hbar\to 0$ the entanglement entropy, computed at…
The operational structure of quantum couplings and entanglements is studied and classified for semifinite von Neumann algebras. We show that the classical-quantum correspondences such as quantum encodings can be treated as diagonal…
Quantum computers can solve specific complex tasks for which no reasonable-time classical algorithm is known. Quantum computers do however also offer inherent security of data, as measurements destroy quantum states. Using shared entangled…
Phenomena induced by the existence of entanglement, such as nonlocal correlations, exhibit characteristic properties of quantum mechanics distinguishing from classical theories. When entanglement is accompanied by classical communication,…
In this article, we present an introduction to quantum computing (QC) tailored for computing professionals such as programmers, machine learning engineers, and data scientists. Our approach abstracts away the physics underlying QC, which…
Quantum information science has leaped forward with the exploration of high-dimensional quantum systems, offering greater potential than traditional qubits in quantum communication and quantum computing. To advance the field of…
Shared entanglement can significantly amplify classical correlations between systems interacting over a limited quantum channel. A natural avenue is to use entanglement of the same dimension as the channel because this allows for unitary…
Quantum entanglement -- correlations of particles that are stronger than any classical analogue -- is the basis for research on the foundations of quantum mechanics and for practical applications such as quantum networks. Traditionally,…
The work is intended to represent some interesting and apparently peculiar features of entangled system in both pure as well as mixed states level. In the pure state level, we are largely concerned about the existence and characteristics of…
Entanglement detection is a fundamental task in quantum information science, serving as a cornerstone for quantum benchmarking and foundational studies. With an increasing qubit number that can be effectively controlled, there is a pressing…
The frame of classical probability theory can be generalized by enlarging the usual family of random variables in order to encompass nondeterministic ones: this leads to a frame in which two kinds of correlations emerge: the classical…
We demonstrate that, in the case of Shor's algorithm for factoring, highly mixed states will allow efficient quantum computation, indeed factorization can be achieved efficiently with just one initial pure qubit and a supply of initally…
Wave-particle duality is the most fundamental description of the nature of a quantum object which behaves like a classical particle or wave depending on the measurement apparatus. On the other hand, entanglement represents nonclassical…
A quantum algorithm succeeds not because the superposition principle allows 'the computation of all values of a function at once' via 'quantum parallelism,' but rather because the structure of a quantum state space allows new sorts of…
Entanglement and quantum communication are paradigmatic resources in quantum information science leading to correlations between systems that have no classical analogue. Correlations due to entanglement when communication is absent have for…
Entanglement is the powerful and enigmatic resource central to quantum information processing, which promises capabilities in computing, simulation, secure communication, and metrology beyond what is possible for classical devices. Exactly…
According to the Gottesman-Knill theorem, any quantum algorithm utilising operations chosen exclusively from a particular restricted set are efficiently simulable by a classical computer. Since some of these algorithms involve entangled…
Quantum algorithms are known for providing more efficient solutions to certain computational tasks than any corresponding classical algorithm. Here we show that a single qudit is sufficient to implement an oracle based quantum algorithm,…
We propose a simple setup for the conversion of multipartite entangled states in a quantum network with restricted access. The scheme uses nonlocal operations to enable the preparation of states that are inequivalent under local operations…