The world is one step closer to secure quantum communication on a global scale
University of Waterloo researchers combine Nobel prize-winning concepts to achieve scientific breakthrough
IMAGE:
THE ENTANGLED PHOTON SOURCE, AN INDIUM-BASED QUANTUM DOT EMBEDDED IN A SEMICONDUCTOR NANOWIRE (LEFT), AND A VISUALIZATION OF HOW THE ENTANGLED PHOTONS ARE EFFICIENTLY EXTRACTED FROM THE NANOWIRE.
view moreCREDIT: UNIVERSITY OF WATERLOO
Researchers at the University of Waterloo's Institute for Quantum Computing (IQC) have brought together two Nobel prize-winning research concepts to advance the field of quantum communication.
Scientists can now efficiently produce nearly perfect entangled photon pairs from quantum dot sources.
Entangled photons are particles of light that remain connected, even across large distances, and the 2022 Nobel Prize in Physics recognized experiments on this topic. Combining entanglement with quantum dots, a technology recognized with the Nobel Prize in Chemistry in 2023, the IQC research team aimed to optimize the process for creating entangled photons, which have a wide variety of applications, including secure communications.
"The combination of a high degree of entanglement and high efficiency is needed for exciting applications such as quantum key distribution or quantum repeaters, which are envisioned to extend the distance of secure quantum communication to a global scale or link remote quantum computers," said Dr. Michael Reimer, professor at IQC and Waterloo's Department of Electrical and Computer Engineering. "Previous experiments only measured either near-perfect entanglement or high efficiency, but we're the first to achieve both requirements with a quantum dot."
By embedding semiconductor quantum dots into a nanowire, the researchers created a source that creates near-perfect entangled photons 65 times more efficiently than previous work. This new source, developed in collaboration with the National Research Council of Canada in Ottawa, can be excited with lasers to generate entangled pairs on command. The researchers then used high-resolution single photon detectors provided by Single Quantum in The Netherlands to boost the degree of entanglement.
"Historically, quantum dot systems were plagued with a problem called fine structure splitting, which causes an entangled state to oscillate over time. This meant that measurements taken with a slow detection system would prevent the entanglement from being measured," said Matteo Pennacchietti, a PhD student at IQC and Waterloo's Department of Electrical and Computer Engineering. "We overcame this by combining our quantum dots with a very fast and precise detection system. We can basically take a timestamp of what the entangled state looks like at each point during the oscillations, and that's where we have the perfect entanglement."
To showcase future communications applications, Reimer and Pennacchietti worked with Dr. Norbert Lütkenhaus and Dr. Thomas Jennewein, both IQC faculty members and professors in Waterloo's Department of Physics and Astronomy, and their teams. Using their new quantum dot entanglement source, the researchers simulated a secure communications method known as quantum key distribution, proving that the quantum dot source holds significant promise in the future of secure quantum communications.
This research, Oscillating photonic Bell state from a semiconductor quantum dot for quantum key distribution, was recently published in Communications Physics by Pennacchietti, Reimer, Jennewein, Lütkenhaus, Brady Cunard, Shlok Nahar, and Sayan Gangopadhyay from IQC, alongside their collaborators Dr.
JOURNAL
Communications Physics
Where quantum computers can score
Peer-Reviewed PublicationThe travelling salesman problem is considered a prime example of a combinatorial optimisation problem. Now a Berlin team led by theoretical physicist Prof. Dr. Jens Eisert of Freie Universität Berlin and HZB has shown that a certain class of such problems can actually be solved better and much faster with quantum computers than with conventional methods.
Quantum computers use so-called qubits, which are not either zero or one as in conventional logic circuits, but can take on any value in between. These qubits are realised by highly cooled atoms, ions or superconducting circuits, and it is still physically very complex to build a quantum computer with many qubits. However, mathematical methods can already be used to explore what fault-tolerant quantum computers could achieve in the future. "There are a lot of myths about it, and sometimes a certain amount of hot air and hype. But we have approached the issue rigorously, using mathematical methods, and delivered solid results on the subject. Above all, we have clarified in what sense there can be any advantages at all," says Prof. Dr. Jens Eisert, who heads a joint research group at Freie Universität Berlin and Helmholtz-Zentrum Berlin.
The well-known problem of the travelling salesman serves as a prime example: A traveller has to visit a number of cities and then return to his home town. Which is the shortest route? Although this problem is easy to understand, it becomes increasingly complex as the number of cities increases and computation time explodes. The travelling salesman problem stands for a group of optimisation problems that are of enormous economic importance, whether they involve railway networks, logistics or resource optimisation. Good enough solutions can be found using approximation methods.
The team led by Jens Eisert and his colleague Jean-Pierre Seifert has now used purely analytical methods to evaluate how a quantum computer with qubits could solve this class of problems. A classic thought experiment with pen and paper and a lot of expertise. "We simply assume, regardless of the physical realisation, that there are enough qubits and look at the possibilities of performing computing operations with them," explains Vincent Ulitzsch, a PhD student at the Technical University of Berlin. In doing so, they unveiled similarities to a well-known problem in cryptography, i.e. the encryption of data. "We realised that we could use the Shor algorithm to solve a subclass of these optimisation problems," says Ulitzsch. This means that the computing time no longer "explodes" with the number of cities (exponential, 2N), but only increases polynomially, i.e. with Nx, where x is a constant. The solution obtained in this way is also qualitatively much better than the approximate solution using the conventional algorithm.
"We have shown that for a specific but very important and practically relevant class of combinatorial optimisation problems, quantum computers have a fundamental advantage over classical computers for certain instances of the problem," says Eisert.
JOURNAL
Science Advances
METHOD OF RESEARCH
Computational simulation/modeling
SUBJECT OF RESEARCH
Not applicable
ARTICLE TITLE
An in-principle super-polynomial quantum advantage for approximating combinatorial optimization problems via computational learning theory
ARTICLE PUBLICATION DATE
15-Mar-2024
No comments:
Post a Comment