arXiv subjects

Tal Mor

Publications and source records attributed to Tal Mor.

68 records · Page 4Linked to original sources

arXiv2000

Unextendible Product Bases, Uncompletable Product Bases and Bound Entanglement

We report new results and generalizations of our work on unextendible product bases (UPB), uncompletable product bases and bound entanglement. We present a new construction for bound entangled states based on product bases which are only completable in a locally extended Hilbert space. We introduce a very useful representation of a product basis, an orthogonality graph. Using this representation we give a complete characterization of unextendible product bases for two qutrits. We present several generalizations of UPBs to arbitrary high dimensions and multipartite systems. We present a sufficient condition for sets of orthogonal product states to be distinguishable by separable superoperators. We prove that bound entangled states cannot help increase the distillable entanglement of a state beyond its regularized entanglement of formation assisted by bound entanglement.

quant-ph↗

arXiv1999

A Proof of the Security of Quantum Key Distribution

We prove the security of quantum key distribution against the most general attacks which can be performed on the channel, by an eavesdropper who has unlimited computation abilities, and the full power allowed by the rules of classical and quantum physics. A key created that way can then be used to transmit secure messages in a way that their security is also unaffected in the future.

quant-ph↗

arXiv1999

Security Aspects of Practical Quantum Cryptography

The use of quantum bits (qubits) in cryptography holds the promise of secure cryptographic quantum key distribution schemes. Unfortunately, the implemented schemes can be totally insecure. We provide a thorough investigation of security issues for practical quantum key distribution, taking into account channel losses, a realistic detection process, and modifications of the ``qubits'' sent from the sender to the receiver. We first show that even quantum key distribution with perfect qubits cannot be achieved over long distances when fixed channel losses and fixed dark count errors are taken into account. Then we show that existing experimental schemes (based on ``weak-pulse'') are usually totally insecure. Finally we show that parametric downconversion offers enhanced performance compared to its weak coherent pulse counterpart.

quant-ph↗

arXiv1999

Algorithms on Ensemble Quantum Computers

In ensemble (or bulk) quantum computation, measurements of qubits in an individual computer cannot be performed. Instead, only expectation values can be measured. As a result of this limitation on the model of computation, various important algorithms cannot be processed directly on such computers, and must be modified. We provide modifications of various existing protocols, including algorithms for universal fault--tolerant computation, Shor's factorization algorithm (which can be extended to any algorithm computing an NP function), and some search algorithms to enable processing them on ensemble quantum computers.

quant-ph↗

arXiv1999

Sufficient conditions for a disentanglement

We consider a disentanglement process in which local properties of an entangled state are preserved, while the entanglement between the subsystems is erased. Sufficient conditions for a perfect disentanglement (into product states and into separable states) are derived, and connections to the conditions for perfect cloning and for perfect broadcasting are observed.

quant-ph↗

arXiv1999

Quantum memory in quantum cryptography

[Shortened abstract:] This thesis investigates the importance of quantum memory in quantum cryptography, concentrating on quantum key distribution schemes. In the hands of an eavesdropper -- a quantum memory is a powerful tool, putting in question the security of quantum cryptography; Classical privacy amplification techniques, used to prove security against less powerful eavesdroppers, might not be effective when the eavesdropper can keep quantum states for a long time. In this work we suggest a possible direction for approaching this problem. We define strong attacks of this type, and show security against them, suggesting that quantum cryptography is secure. We start with a complete analysis regarding the information about a parity bit (since parity bits are used for privacy amplification). We use the results regarding the information on parity bits to prove security against very strong eavesdropping attacks, which uses quantum memories and all classical data (including error correction codes) to attack the final key directly. In the hands of the legitimate users, a quantum memory is also a useful tool. We suggest a new type of quantum key distribution scheme where quantum memories are used instead of quantum channels. This scheme is especially adequate for networks of many users. The use of quantum memory also allows reducing the error rate to improve large scale quantum cryptography, and to enable the legitimate users to work with reasonable error rate.

quant-ph↗

arXiv1999

Quantum cryptography via parametric downconversion

The use of quantum bits (qubits) in cryptography holds the promise of secure cryptographic quantum key distribution schemes. It is based usually on single-photon polarization states. Unfortunately, the implemented ``qubits'' in the usual weak pulse experiments are not true two-level systems, and quantum key distribution based on these imperfect qubits is totally insecure in the presence of high (realistic) loss rate. In this work, we investigate another potential implementation: qubits generated using a process of parametric downconversion. We find that, to first (two-photon) and second (four-photon) order in the parametric downconversion small parameter, this implementation of quantum key distribution is equivalent to the theoretical version. Once realistic measurements are taken into account, quantum key distribution based on parametric downconversion suffers also from sensitivity to extremely high (nonrealistic) losses. By choosing the small parameter of the process according to the loss rates, both implementations of quantum key distribution can in principle become secure against the attack studied in this paper. However, adjusting the small parameter to the required levels seems to be impractical in the weak pulse process. On the other hand, this can easily be done in the parametric downconversion process, making it a much more promising implementation.

quant-ph↗

arXiv1999

On Universal and Fault-Tolerant Quantum Computing

A novel universal and fault-tolerant basis (set of gates) for quantum computation is described. Such a set is necessary to perform quantum computation in a realistic noisy environment. The new basis consists of two single-qubit gates (Hadamard and ${σ_z}^{1/4}$), and one double-qubit gate (Controlled-NOT). Since the set consisting of Controlled-NOT and Hadamard gates is not universal, the new basis achieves universality by including only one additional elementary (in the sense that it does not include angles that are irrational multiples of $π$) single-qubit gate, and hence, is potentially the simplest universal basis that one can construct. We also provide an alternative proof of universality for the only other known class of universal and fault-tolerant basis proposed by Shor and by Kitaev.

quant-ph↗

arXiv1999

Teleportation via generalized measurements, and conclusive teleportation

In this work we show that teleportation is a special case of a generalized Einstein, Podolsky, Rosen (EPR) non-locality. Based on the connection between teleportation and generalized measurements we define conclusive teleportation. We show that perfect conclusive teleportation can be obtained with any pure entangled state, and it can be arbitrarily approached with a particular mixed state.

quant-ph↗

arXiv1999

Electron Spin Resonance Transistors for Quantum Computing in Silicon-Germanium Heterostructures

We apply the full power of modern electronic band structure engineering and epitaxial heterostructures to design a transistor that can sense and control a single donor electron spin. Spin resonance transistors may form the technological basis for quantum information processing. One and two qubit operations are performed by applying a gate bias. The bias electric field pulls the electron wave function away from the dopant ion into layers of different alloy composition. Owing to the variation of the g-factor (Si:g=1.995, Ge:g=1.563), this displacement changes the spin Zeeman energy, allowing single-qubit operations. By displacing the electron even further, the overlap with neighboring qubits is affected, which allows two-qubit operations. Certain Silicon-Germanium alloys allow a qubit spacing as large as 200 nm, which is well within the capabilities of current lithographic techniques. We discuss manufacturing limitations and issues regarding scaling up to a large size computer.

quant-ph↗

arXiv1998

On the Disentanglement of States

Disentanglement is the process which transforms a state $ρ$ of two subsystems into an unentangled state, while not effecting the reduced density matrices of each of the two subsystems. Recently Terno showed that an arbitrary state cannot be disentangled into a tensor product of its reduced density matrices. In this letter we present various novel results regarding disentanglement of states. Our main result is that there are sets of states which cannot be successfuly disentangled (not even into a separable state). Thus, we prove that a universal disentangling machine cannot exist.

quant-ph↗

arXiv1998

Quantum Nonlocality without Entanglement

We exhibit an orthogonal set of product states of two three-state particles that nevertheless cannot be reliably distinguished by a pair of separated observers ignorant of which of the states has been presented to them, even if the observers are allowed any sequence of local operations and classical communication between the separate observers. It is proved that there is a finite gap between the mutual information obtainable by a joint measurement on these states and a measurement in which only local actions are permitted. This result implies the existence of separable superoperators that cannot be implemented locally. A set of states are found involving three two-state particles which also appear to be nonmeasurable locally. These and other multipartite states are classified according to the entropy and entanglement costs of preparing and measuring them by local operations.

quant-ph↗

arXiv1998

No-cloning of Orthogonal States in Composite Systems

The no-cloning principle tells us that non-orthogonal quantum states cannot be cloned, but it does not tell us that orthogonal states can always be cloned. We suggest a situation where the cloning transformations are restricted, leading to a novel type of no-cloning principle. In the case of a composite system made of two subsystems: if the subsystems are only available one after the other then there are various cases when orthogonal states cannot be cloned. Surprising examples are given, which give a radically better insight regarding the basic concepts of quantum cryptography.

quant-ph↗

arXiv1998

Security of Quantum Key Distribution Against All Collective Attacks

Security of quantum key distribution against sophisticated attacks is among the most important issues in quantum information theory. In this work we prove security against a very important class of attacks called collective attacks (under a compatible noise model) which use quantum memories and gates, and which are directed against the final key. Although attacks stronger than the collective attacks can exist in principle, no explicit example was found and it is conjectured that security against collective attacks implies also security against any attack.

quant-ph↗