Springe direkt zu Inhalt


Mentioned among top 100 researchers of Berlin

The Tagesspiegel , the leading newspaper of Berlin, has made a survey of the "100 most important minds in Berlin science 2023".

Oct 01, 2023

Benchmarking quantum computers

How can one calibrate quantum computers to extremely high precision? Our work published in Nature Communications shows that one feasible kind of data from randomized benchmarking is sufficient to obtain a wealth of diagnostic information, ranging from randomized benchmarking with no end gate over full noise characterization and cross talk tomography. That is, from one dataset, one can in a robust and sample-optimal fashion calibrate quantum circuits. For articles in the academic press, see these links. Berlin Tagesspiegel: Forschung zu Quantencomputern: Ein Tüv für die Zukunftsrechner PhysOrg: Physicists develop series of quality control tests for quantum computers ProPhysik: Ein Qualitätstests für Quantencomputer Informationsdienst Wissenschaft: Quantencomputer: Gewissheit aus dem Zufall ziehen ScienMag: Quantum computing: Benchmarking performance by random data

Sep 01, 2023

Quantum simulation with light

How can one think of pursuing quantum simulations of non-Gaussian states with light? Our new work in Nature Communications addresses this question. It shows how the emergence of properties of statistical physics in quantum theory can be reconciled and empirically probed. The significance of this work may not only stem from the actual application in quantum simulation, but from nitty gritty method development on how one can certify and witness certain quantum properties in integrated optical devices, with applications in optical quantum computing in mind. For articles in the academic press, see these links. PhysOrg, "Photonics experiment resolves quantum paradox " Photonics World, "Twente photonics experiment resolves longstanding quantum paradox" Yahoo, "Paradox, Solved: Thermodynamics and quantum mechanics CAN be true at the same time" SciTech Daily, "Time reversal photonics experiment resolves quantum paradox" NewsBeezer, "Time-reversal photonics experiment solves quantum paradox"

Jul 10, 2023

Probing curved light cones on an analog quantum simulator

How can the non-equilibrium dynamics of a quantum field featuring curved light cones be simulated with an analog quantum simulato r ? We show this based on two tunneling-coupled superfluids in one-dimensional traps. We are happy to see this work in the  Proceedings of the National Academy of Sciences . A press release can be found here .

May 16, 2023

A comprehensive review on quantum advantages with quantum random sampling

Quantum random sampling is the leading proposal for demonstrating a computational advantage of quantum computers over classical computers. Recently, first large-scale implementations of quantum random sampling have arguably surpassed the boundary of what can be simulated on existing classical hardware. In this article , we comprehensively review the theoretical underpinning of quantum random sampling in terms of computational complexity and verifiability, as well as the practical aspects of its experimental implementation using superconducting and photonic devices and its classical simulation. We discuss in detail open questions in the field and provide perspectives for the road ahead, including potential applications of quantum random sampling. This work is in press with the Reviews of Modern Physics .

Mar 10, 2023

Our team wins the best poster award at QIP

The team of Marcel Hinsche , Marios Ioannou , Alexander Nietner , Jonas Haferkamp , Yihui Quek , Dominik Hangleiter , Jean-Pierre Seifert , Jens Eisert , Ryan Sweke wins the best poster award at QIP 2023 . 

Feb 02, 2023

Talk at QIP 2023

We will present a talk at QIP 2023 on limitations of quantum error mitigation of even log-log-deep quantum circuits, based on arXiv:2210.11505 .

Jan 01, 2023

Deutsche Welle interview on quantum computing

The international German public television broadcaster Deutsche Welle interviews Rainer Blatt and Jens Eisert on the perspectives of quantum computing .

Dec 21, 2022

Work on a super-polynomial quantum advantage in combinatorial optimization

Combinatorial optimization - a field of research addressing problems that feature strongly in a wealth of practical and industrial contexts - has been identified as one of the core potential fields of applicability of near-term quantum computers. It is still unclear, however, to what extent variational quantum algorithms can actually outperform classical algorithms for this type of problems. In this work , by resorting to computational learning theory and cryptographic notions, we prove that fault-tolerant quantum computers feature a super-polynomial advantage over classical computers in approximating solutions to combinatorial optimization problems. Specifically, building on seminal work of Kearns and Valiant, we construct special instances of the integer programming problem (which in its most general form is NP-complete) that we prove to be hard-to-approximate classically but give an efficient quantum algorithm to approximate the optimal solution of those instances, hence showing a super-polynomial quantum advantage. This result shows that quantum devices have the power to approximate combinatorial optimization solutions beyond the reach of classical efficient algorithms.

Dec 20, 2022

A group outing on Peacock Island

We are enjoying a wonderful group outing on Peacock Island, a small island in lake Wannsee. Thanks, Elies, for organizing this.

Sep 22, 2022

An article in Tagesspiegel

In Berlin's daily newspaper Tagesspiegel , Jens Eisert explains in a long article how quantum computers function and what we can expect from them in the near future.

Sep 22, 2022

Work on "quantum homeopathy" in the Communications of Mathematical Physics

Unitary designs are important tools in quantum information theory, as collections of unitaries that resemble averages over the Haar measure. So-called k-designs recover k-th moments exactly. They have a wealth of applications in technology-oriented fields such as benchmarking, certification as well as in fundamental quantum physics. Random Clifford operations are 3-designs, but just not 4-designs, which constitutes a roadblock in some applications. Adding (expensive) T-gates will uplift such random circuits to k-designs of arbitrary order. But the question arises how of those many one needs? It turns out that strikingly, a non-extensive number is sufficient: One will still arrive at a design of arbitrary order. This technical and mathematically minded work - that jokingly can be explained as quantum homeopathy actually working - goes to press in the Communications of Mathematical Physics , the most prestigious venue for mathematical physics. .

Sep 21, 2022

Campus run 2022

Our team has participated in the Berlin Campus Run 2022 . It has been great fun.

Jun 16, 2022

Re:publica 2022

As part of an outreach activity at re:publica 2022 , the quantum scientist Jasmin Meincke, the quantum scientist and artist Libby Heaney and Jens Eisert have organized a session on " living in a quantum state ", bringing together ideas of science and the arts.

Jun 10, 2022

Proof of the Brown Susskind conjecture in Nature Physics

Quantifying quantum states' complexity is a key problem in various subfields of science, from quantum computing to black-hole physics. In our work in Nature Physics we prove a prominent conjecture by Brown and Susskind about how random quantum circuits' complexity increases. Consider constructing a unitary from Haar-random two-qubit quantum gates. Implementing the unitary exactly requires a circuit of some minimal number of gates - the unitary's exact circuit complexity. We prove that this complexity grows linearly in the number of random gates, with unit probability, until saturating after exponentially many random gates. Our proof is surprisingly short, given the established difficulty of lower-bounding the exact circuit complexity. Our strategy combines differential topology and elementary algebraic geometry with an inductive construction of Clifford circuits. This work has received substantial attention and it has been greeted by several articles in the popular press and by press releases . This work is also the first in the group to hit over 100 scites on Scirate .

Apr 02, 2022

Work on quantum advantages in Science Advances

Can near-term quantum devices outperform classical computers? This question is also at the heart of efforts of the Einstein Research Unit on near-term quantum devices . We address this question here for high-dimensional Gaussian boson sampling in work that has been published in the Science Advances . Photonics is a promising platform for demonstrating quantum computational supremacy (QCS) by convincingly outperforming the most powerful classical supercomputers on a well-defined computational task. Despite this promise, existing photonics proposals and demonstrations face significant hurdles. Experimentally, current implementations of Gaussian boson sampling lack programmability or have prohibitive loss rates. Theoretically, there is a comparative lack of rigorous evidence for the classical hardness of GBS. In this work, we make significant progress in improving both the theoretical evidence and experimental prospects. On the theory side, we provide strong evidence for the hardness of Gaussian boson sampling, placing it on par with the strongest theoretical proposals for QCS. On the experimental side, we propose a new QCS architecture, high-dimensional Gaussian boson sampling, which is programmable and can be implemented with low loss rates using few optical components. We show that particular classical algorithms for simulating GBS are vastly outperformed by high-dimensional Gaussian boson sampling experiments at modest system sizes. This work thus opens the path to demonstrating QCS with programmable photonic processors.

Jan 10, 2022

What a year

Thanks so much to the group members of our team for the good vibes, the wonderful scientific discussions, all those excellent ideas. It has not always been easy outside our control, but we have been doing well. The revived discussion culture in the department has been fun. And over the summer and fall the many garden meetings we have had. This may also be a good moment to think what good lessons can be learned from the crisis. The garden meetings we will surely maintain. While this may be a somewhat superficial metric, it is still nice to see that five publications came out of the group this year in the Nature and Science groups, six in Physical Review X and PRX Quantum , seven in the Physical Review Letters , and one in the Reviews of Modern Physics . What is particularly pleasing is that five pieces of work have been published in the community driven Quantum and SciPost Physics . Happy new year.

Dec 31, 2021

Second place in best paper award

Work on the randomized implementation of multi-product formulas for Hamiltonian simulation ( https://arxiv.org/abs/2101.07808 ) has been awarded the USRA- Q2B ANISQC Best Paper Award 2021. Congratulations, Paul Faehrmann and coauthors.

Dec 14, 2021

Work on a quantum network advantage in PRX Quantum

Is a quantum network advantage in practical quantum communication conceivable. New work to be published in PRX Quantum is addressing this question to the affirmative. Secret sharing is a multi-party cryptographic primitive that can be applied to a network of partially distrustful parties for encrypting data that is both sensitive (it must remain secure) and important (it must not be lost or destroyed). When sharing classical secrets (as opposed to quantum states), one can distinguish between protocols that leverage bi-partite quantum key distribution (QKD) and those that exploit multi-partite entanglement. The latter class are known to be vulnerable to so-called participant attacks and, while progress has been made recently, there is currently no analysis that quantifies their performance in the composable, finite-size regime which has become the gold standard for QKD security. Given this - and the fact that distributing multi-partite entanglement is typically challenging - one might well ask: Is there is any virtue in pursuing multi-partite entanglement based schemes? Here, we answer this question in the affirmative for a class of secret sharing protocols based on continuous variable graph states. We establish security in a composable framework and identify a network topology, specifically a bottleneck network of lossy channels, and parameter regimes within the reach of present day experiments for which a multi-partite scheme outperforms the corresponding QKD based method in the asymptotic and finite-size setting. Finally, we establish experimental parameters where the multi-partite schemes outperform any possible QKD based protocol. This one of the first concrete compelling examples of multi-partite entangled resources achieving a genuine advantage over point-to-point protocols for quantum communication and represents a rigorous, operational benchmark to assess the usefulness of such resources.

Nov 22, 2021

Work on quantum machine learning in Quantum

How well do quantum-assisted machine learning algorithms perform on unseen data? New w ork pushlished in Quantum is addressing this question. A large body of recent work has begun to explore the potential of parametrized quantum circuits (PQCs) as machine learning models, within the framework of hybrid quantum-classical optimization. In particular, theoretical guarantees on the out-of-sample performance of such models, in terms of generalization bounds, have emerged. However, none of these generalization bounds depend explicitly on how the classical input data is encoded into the PQC. We derive generalization bounds for PQC-based models that depend explicitly on the strategy used for data-encoding. These imply bounds on the performance of trained PQC-based models on unseen data. Moreover, our results facilitate the selection of optimal data-encoding strategies via structural risk minimization, a mathematically rigorous framework for model selection. We obtain our generalization bounds by bounding the complexity of PQC-based models as measured by the Rademacher complexity and the metric entropy, two complexity measures from statistical learning theory. To achieve this, we rely on a representation of PQC-based models via trigonometric functions. Our generalization bounds emphasize the importance of well-considered data-encoding strategies for PQC-based models.

Nov 01, 2021