Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Lisa Hänggli

dblp:312/1987 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2022
0000-0002-6001-1188ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Quantum computing and quantum information · 87% Information theory · 13%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Quantum computing and quantum information
quantum error correction
0.612022
Oscillator-to-Oscillator Codes Do Not Have a Threshold · IEEE Trans. Inf. Theory 2022
Quantum computing and quantum information › quantum error correction
threshold theorem
0.612022
Oscillator-to-Oscillator Codes Do Not Have a Threshold · IEEE Trans. Inf. Theory 2022

Methods — techniques the papers use, named apart from their topics

maximum-likelihood decoding · 0.6
YearPublicationVenuePosition
2022 Oscillator-to-Oscillator Codes Do Not Have a Threshold
abstract
It is known that continuous variable quantum information cannot be protected against naturally occurring noise using Gaussian states and operations only. Noh et al. (PRL 125:080503, 2020) proposed bosonic oscillator-to-oscillator codes relying on non-Gaussian resource states as an alternative, and showed that these encodings can lead to a reduction of the effective error strength at the logical level as measured by the variance of the classical displacement noise channel. An oscillator-to-oscillator code embeds K logical bosonic modes (in an arbitrary state) into N physical modes by means of a Gaussian N-mode unitary and N-K auxiliary one-mode Gottesman-Kitaev-Preskill-states. Here we ask if - in analogy to qubit error-correcting codes - there are families of oscillator-to-oscillator codes with the following threshold property: They allow to convert physical displacement noise with variance below some threshold value to logical noise with variance upper bounded by any (arbitrary) constant. We find that this is not the case if encoding unitaries involving a constant amount of squeezing and maximum likelihood error decoding are used. We show a general lower bound on the logical error probability which is only a function of the amount of squeezing and independent of the number of modes. As a consequence, any physically implementable family of oscillator-to-oscillator codes combined with maximum likelihood error decoding does not admit a threshold.
Lisa Hänggli, Robert König
IEEE Trans. Inf. Theory1