Tal  Mor

Prof. Tal Mor

Department of Computer Science, Technion–Israel Institute of Technology, Haifa 3200003, Israel

Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
19 March 2002 in Proceedings of the National Academy of Sciences
Verified
Journal Article
Closed access
PBP. Oscar Boykin
P. Oscar Boykin
TTal Mor
Tal Mor
VRVwani Roychowdhury
Vwani Roychowdhury
FVFarrokh Vatan
Farrokh Vatan
RVRutger Vrijen
Rutger Vrijen
We present here algorithmic cooling (via polarization heat bath)—a powerful method for obtaining a large number of highly polarized spins in liquid nuclear-spin systems at finite temperature. Given that spin-half states represent (quantum) bits, algorithmic cooling cleans dirty bits beyond the Shannon's bound on data compression, by using a set of rapidly thermal-relaxing bits. Such auxiliary bits could be implemented by using spins that rapidly get into thermal equilibrium with the environment, e.g., electron spins. Interestingly, the interaction with the environment, usually a most undesired interaction, is used here to our benefit, allowing a cooling mechanism. Cooling spins to a very low temperature without cooling the environment could lead to a breakthrough in NMR experiments, and our “spin-refrigerating” method suggests that this is possible. The scaling of NMR ensemble computers is currently one of the main obstacles to building larger-scale quantum computing devices, and our spin-refrigerating method suggests that this problem can be resolved.

24 April 2006 in Journal of Cryptology
Verified
Journal Article
Closed access
PDF file
EBEli Biham
Eli Biham
Michel BoyerMichel Boyer
Michel Boyer
PBP. Oscar Boykin
P. Oscar Boykin
TTal Mor
Tal Mor
VRVwani Roychowdhury
Vwani Roychowdhury

29 December 2017 in Physical Review A
Verified
Journal Article
Closed access
PDF file
Michel BoyerMichel Boyer
Michel Boyer
MKMatty Katz
Matty Katz
RLRotem Liss
Rotem Liss
TTal Mor
Tal Mor
Quantum key distribution (QKD) protocols make it possible for two quantum parties to generate a secret shared key. Semiquantum key distribution (SQKD) protocols, such as “QKD with classical Bob” and “QKD with classical Alice” (that have both been proven robust), achieve this goal even if one of the parties is classical. However, existing SQKD protocols are not experimentally feasible with current technology. Here we suggest a protocol, “Classical Alice with a controllable mirror,” that can be experimentally implemented with current technology (using four-level systems instead of qubits), and we prove it to be robust.

7 March 2017 in Physical Review A
Verified
Journal Article
Closed access
PDF file
Michel BoyerMichel Boyer
Michel Boyer
RLRotem Liss
Rotem Liss
TTal Mor
Tal Mor
Entanglement is an important concept in quantum information, quantum communication, and quantum computing. We provide a geometrical analysis of entanglement and separability for all the rank 2 quantum mixed states: complete analysis for the bipartite states and partial analysis for the multipartite states. For each rank 2 mixed state, we define its unique Bloch sphere, that is spanned by the eigenstates of its density matrix. We characterize those Bloch spheres into exactly five classes of entanglement and separability, give examples for each class, and prove that those are the only classes.

21 February 2017 in Physical Review A
Verified
Journal Article
Closed access
PDF file
Michel BoyerMichel Boyer
Michel Boyer
ABAharon Brodutch
Aharon Brodutch
TTal Mor
Tal Mor
The role of entanglement and quantum correlations in complex physical systems and quantum information processing devices has become a topic of intense study in the past two decades. In this work we present tools for learning about entanglement and quantum correlations in dynamical systems where the quantum states are mixed and the eigenvalue spectrum is highly degenerate. We apply these results to the deterministic quantum computing with one qubit (DQC1) computation model and show that the states generated in a DQC1 circuit have an eigenvalue structure that makes them difficult to entangle, even when they are relatively far from the completely mixed state. Our results strengthen the conjecture that it may be possible to find quantum algorithms that do not generate entanglement and yet still have an exponential advantage over their classical counterparts.

18 July 2018 in Entropy
Verified
Journal Article
Open access
PDF file
Michel BoyerMichel Boyer
Michel Boyer
RLRotem Liss
Rotem Liss
TTal Mor
Tal Mor
A semiquantum key distribution (SQKD) protocol makes it possible for a quantum party and a classical party to generate a secret shared key. However, many existing SQKD protocols are not experimentally feasible in a secure way using current technology. An experimentally feasible SQKD protocol, “classical Alice with a controllable mirror” (the “Mirror protocol”), has recently been presented and proved completely robust, but it is more complicated than other SQKD protocols. Here we prove a simpler variant of the Mirror protocol (the “simplified Mirror protocol”) to be completely non-robust by presenting two possible attacks against it. Our results show that the complexity of the Mirror protocol is at least partly necessary for achieving robustness.