Anthony Leverrier @letonyo Twitter profile

Last Seen Profiles

@AidanKuykendall

@kishdoodles

@FaEstay

@kkionty_

@kanatakunndesu

@sakimichanmale

@ALZST4RR

@yosameti

@univshoujo

@ZionTempleCC

@macarrex

@taketsu365happy

@0muEytoqHsnpHal

@MoosaZameer

@luhsevn

@Thefirstclass_C

@bsharks7

@mans_3aq

@QuindyPy

@LyondellBasell

@WNBA

@angeldustchan

@buzz_poll

@L3c18qYY3939472

@EdrIntriag

@Hi8673906124295

@PORFoundation

@firaskayali421

@holyempresskira

@TaimAlFalasi

@Allgorov

@cem_engineering

@RedScare

@wildpeachfarm

@AnthonyBra88977

@RedScare

Anthony Leverrier

@letonyo

2 months

"This gives a polynomial time quantum algorithm for solving LWE." Is this real?

29

153

1K

Anthony Leverrier

@letonyo

2 years

This is what responsible research looks like:

On a gap in the proof of the generalised quantum Stein's lemma...

We show that the proof of the generalised quantum Stein's lemma [Brandão & Plenio, Commun. Math. Phys. 295, 791 (2010)] is not correct due to a gap in the argument leading to Lemma III.9. Hence,...

arxiv.org

8

31

283

Anthony Leverrier

@letonyo

7 months

The recent review of quantum algorithms is great Can we have a similar - brutally honest - review on various hardware approaches for quantum computing? with a clear presentation of the various limitations (not always sufficiently advertised in papers?)

Quantum algorithms: A survey of applications and end-to-end complexities

The anticipated applications of quantum computers span across science and industry, ranging from quantum chemistry and many-body physics to optimization, finance, and machine learning. Proposed...

arxiv.org

9

36

241

Anthony Leverrier

@letonyo

2 months

@LamiLudovico among them, those based on the hardness of lattice problem are certainly the most popular and well studied. Their security relies on the assumption that the pb called LWE is hard for a q. computer. The paper (if correct) shows that this assumption may not be as sound as hoped.

5

4

215

Anthony Leverrier

@letonyo

4 months

Wow, the latest draft of Daniel Gottesman's book on quantum error correction is available! A must-read for anyone interested in this field:

3

47

201

Anthony Leverrier

@letonyo

2 months

@LamiLudovico Since Shor's algo breaks RSA, cryptographers have started designing new cryptosystems hopefully resistant to quantum computers. The NIST has even launched a competition and recently decided to standardize a few of the "post-quantum" (meaning quantum-resistant) cryptosystems (1/2)

1

7

184

Anthony Leverrier

@letonyo

2 months

Dan Simon, of Simon's algorithm fame, comments on Yilei Chen's new algorithm

4

19

157

Anthony Leverrier

@letonyo

4 months

New progress on Shor's algorithm: factoring an n-bit RSA modulus with n/2 qubits instead of 2n

Reducing the Number of Qubits in Quantum Factoring

This paper focuses on the optimization of the number of logical qubits in quantum algorithms for factoring and computing discrete logarithms in $\mathbb{Z}_N^*$. These algorithms contain an exponen...

eprint.iacr.org

1

49

154

Anthony Leverrier

@letonyo

3 months

6100 atoms! Feels like quantum computers with thousands of qubits are just around the corner

A tweezer array with 6100 highly coherent atomic qubits

Optical tweezer arrays have had a transformative impact on atomic and molecular physics over the past years, and they now form the backbone for a wide range of leading experiments in quantum...

arxiv.org

4

20

115

Anthony Leverrier

@letonyo

2 years

Quantum Information Science lecture notes, by Scott Aaronson!

My Quantum Information Science II Lecture Notes: The wait is over!

Here they are [PDF]. They’re 155 pages of awesome—for a certain extremely specific definition of “awesome”—which I’m hereby offering to the world free of charge …

scottaaronson.blog

0

26

111

Anthony Leverrier

@letonyo

2 months

What happened to quantum tomography? A few years ago, it seemed hopelessly costly. Now it seems super easy, and even with simple procedures. Is this thanks to better analysis or because the questions are not exactly the same as before?

7

5

113

Anthony Leverrier

@letonyo

4 months

if you can find useful applications of a quantum computer (that would benefit society), then Google is ready to give you some money

11

9

104

Anthony Leverrier

@letonyo

2 years

After toying a little with bosonic codes, I've become less and less convinced that future quantum computing will rely on qubits rather than qudits. Until now, I always thought that qudits were just an annoying generalization that we could make, but that didn't bring much (1/3)

7

9

102

Anthony Leverrier

@letonyo

2 years

Daniel Gottesman's review of quantum fault tolerance for the proceeding of the Solvay conference is out! A must-read for everyone in the field.

Opportunities and Challenges in Fault-Tolerant Quantum Computation

I will give an overview of what I see as some of the most important future directions in the theory of fault-tolerant quantum computation. In particular, I will give a brief summary of the major...

arxiv.org

2

15

102

Anthony Leverrier

@letonyo

2 years

When Panteleev and Kalachev introduced their good quantum LDPC codes 6 months ago, the next obvious open question was to design an efficient decoder (1/5)

1

11

90

Anthony Leverrier

@letonyo

2 months

Anthony Leverrier

@letonyo

2 months

"This gives a polynomial time quantum algorithm for solving LWE." Is this real?

29

153

1K

6

11

89

Anthony Leverrier

@letonyo

1 year

@phalpern "His best time of 2 hours, 46 minutes, 3 seconds, was only 11 minutes slower than the winner in the 1948 Olympic Games."

0

2

87

Anthony Leverrier

@letonyo

2 years

Random quantum circuits are unlikely to lead to a scalable violation of the extended Church-Turing thesis. Another evidence what we need quantum error correction to have fun!

A polynomial-time classical algorithm for noisy random circuit sampling

We give a polynomial time classical algorithm for sampling from the output distribution of a noisy random quantum circuit in the regime of anti-concentration to within inverse polynomial total...

arxiv.org

3

12

85

Anthony Leverrier

@letonyo

2 years

Congrats to Pavel Panteleev and Gleb Kalachev for their best paper at STOC 2022 for the discovery of good quantum LDPC codes

1

5

82

Anthony Leverrier

@letonyo

4 months

did that on p.26 and we forgot to remove it in the journal submission...

A Combinatorial Approach to Nonlocality and Contextuality

So far, most of the literature on (quantum) contextuality and the Kochen-Specker theorem seems either to concern particular examples of contextuality, or be considered as quantum logic. Here, we...

arxiv.org

algoritmic

@algoritmic

4 months

Add coffee stains to LaTeX documents

73

1K

10K

3

9

79

Anthony Leverrier

@letonyo

1 year

Geometrically local quantum (LDPC) codes achieving optimal distance in any dimension! Finally! Proof relying on the Freedman-Hastings code to manifold procedure and the existence of good QLDPC codes.

2

13

81

Anthony Leverrier

@letonyo

6 months

The 1000 qubits of IBM relegated to a footnote in Scott's description of the "top experimental QC advance of 2023". This says a lot about the crazy progress of neutral atoms!

Staggering toward quantum fault-tolerance

Happy Hanukkah! I’m returning to Austin from a Bay Area trip that included the annual Q2B (Quantum 2 Business) conference. This year, for the first time, I opened the conference, with a talk …

scottaaronson.blog

1

18

76

Anthony Leverrier

@letonyo

1 year

Can photonic quantum computing really win the race? Terry Rudolph from @PsiQuantum seems to think so!

What is the logical gate speed of a photonic quantum computer?

Terry Rudolph, PsiQuantum & Imperial College London During a recent visit to the wild western town of Pasadena I got into a shootout at high-noon trying to explain the nuances of this question …

quantumfrontiers.com

4

14

74

Anthony Leverrier

@letonyo

2 years

. @preskill to Alain Aspect: "Yes, we were young guys up in the amphitheater and we were waiting to see the reaction of Feynman in front of the young French guy speaking about Foundations of quantum mechanics!" Lots of nice anecdotes in this interview

Experimental tests of Bell's inequalities: A first-hand...

On 04 October 2022, the Royal Swedish Academy of Sciences announced that the Nobel Prize for Physics of 2022 was awarded jointly to Alain Aspect, John Clauser, and Anton Zeilinger "for experiments...

arxiv.org

1

14

75

Anthony Leverrier

@letonyo

1 year

#QIP2023 : acceptance rate per topic: foundations: 11%, complexity 39%, algos 21%, crypto 24%, error correction: 16%

7

6

73

Anthony Leverrier

@letonyo

1 year

@AndreasAtETH @Google @qudev @ETH_en Although I admire your work, I'm not sure how I feel when leaders in the field brag about their citations. Even if it's not your intent, this doesn't help to create an inclusive environment in the field.

3

1

73

Anthony Leverrier

@letonyo

1 year

Nice blogpost about ZX-calculus: only 5 rules to learn!

How ZX-calculus reveals the logic and processes of quantum mechanics to everyone

By Ali Hussein, Peter Sigrist, Ilyas Khan

medium.com

0

15

70

Anthony Leverrier

@letonyo

10 months

#TIL one could improve Shor's algorithm by running a quantum circuit many times, and exploiting a classical lattice reduction algorithm, by @regevlab

An Efficient Quantum Factoring Algorithm

We show that $n$-bit integers can be factorized by independently running a quantum circuit with $\tilde{O}(n^{3/2})$ gates for $\sqrt{n}+4$ times, and then using polynomial-time classical...

arxiv.org

0

7

67

Anthony Leverrier

@letonyo

5 months

qLDPC codes are great (obviously), but if you have a lot of cat qubits, you don't need to worry too much about bit flips and can rely on classical LDPC codes instead. Really fun project with @Ruiz_Diego1 @CVuillot Mazyar Mirrahimi and Jérémie Guillaud from @Alice__Bob

Diego Ruiz

@Ruiz_Diego1

5 months

Cat qubits concatenated with local LDPC codes, check out our new preprint in collaboration with @CVuillot and @letonyo ! We demonstrate that we can encode 100 distance-22 logical qubits with 758 cats, more than 5 times better compared to the repetition code

3

8

59

1

5

66

Anthony Leverrier

@letonyo

7 months

Looks like AWS reached a milestone! Looking forward to more details!

3

8

65

Anthony Leverrier

@letonyo

3 months

quantum LDPC codes on the cover of Nature!

Andreas Wallraff

@AndreasAtETH

3 months

More progress on #quantum error correction this time by @IBM @IBMResearch now in @Nature and on the cover. High-threshold and low-overhead fault-tolerant quantum memory Check it out. free-to-read pdf: web site:

3

36

173

0

4

66

Anthony Leverrier

@letonyo

2 years

Videos of the NISQ workshop at KITP are appearing online. The program looks great!

0

8

65

Anthony Leverrier

@letonyo

1 year

Wait, what? quantum LDPC codes achieving the singleton bound! *Very* cool result by Thiago Bergamaschi, Louis Golowich, Sam Gunn.

4

8

62

Anthony Leverrier

@letonyo

1 year

Bosonic codes are extremely attractive to reduce the overhead of quantum fault-tolerance, by something like a couple of orders of magnitude compared to more standard approaches

Performance Analysis of a Repetition Cat Code Architecture:...

Cat qubits provide appealing building blocks for quantum computing. They exhibit a tunable noise bias yielding an exponential suppression of bit flips with the average photon number and a...

arxiv.org

4

12

60

Anthony Leverrier

@letonyo

2 years

The Future of Biology is Quantum, by @ClariceDAiello

The Future of Biology is Quantum

A proposal for a new scientific research organization

arye.substack.com

2

12

58

Anthony Leverrier

@letonyo

2 years

super interesting plot: # of qubits and time required for the standard long-term applications of quantum computing (with 2D codes)

Anthony Leverrier

@letonyo

2 years

Very interesting paper by the @MSFTResearch team: @krystasvore While 2D architectures are in principle sufficient, they lead to scary numbers when discussing quantum error correction (1/3)

2

11

48

2

11

56

Anthony Leverrier

@letonyo

9 months

I asked a quantum engineer once what it would cost to build this today. I will never forget his answer: "We can't, we don't know how to do it."

Nabeel S. Qureshi

@nabeelqu

9 months

I asked a software engineer once what it would cost to build this today. I will never forget his answer: “We can’t, we don’t know how to do it.”

227

412

6K

0

6

57

Anthony Leverrier

@letonyo

2 years

To have a fighting chance against errors building up in quantum computers, we need highly parallelizable decoding algorithms. With Gilles Zémor, we show that good quantum LDPC admit such fast decoders. (1/2)

Decoding quantum Tanner codes

We introduce sequential and parallel decoders for quantum Tanner codes. When the Tanner code construction is applied to a sufficiently expanding square complex with robust local codes, we obtain a...

arxiv.org

1

8

56

Anthony Leverrier

@letonyo

5 months

"Quantum Error Correction meets Operator Algebras" looks like a fun workshop!

Quantum Error Correction meets Operator Algebras

This workshop is part of QOMBINE, a cross-disciplinary project between mathematics, chemistry, and physics focusing on the mathematics for quantum computation. In this spirit, we want to bring...

www.mn.uio.no

0

9

56

Anthony Leverrier

@letonyo

1 year

So how do you get to enjoy all the promises of good quantum LDPC codes if you're stuck with a 2D connectivity? No need to throw away all your awesome superconducting qubits just yet! Ani Krishna, Chris Pattison and @preskill have some ideas!

Hierarchical memories: Simulating quantum LDPC codes with local gates

Constant-rate low-density parity-check (LDPC) codes are promising candidates for constructing efficient fault-tolerant quantum memories. However, if physical gates are subject to...

arxiv.org

2

11

56

Anthony Leverrier

@letonyo

2 months

@ghostway_chess right, but this is still way too close for comfort. If the paper is correct, I don't think anybody will put much trust into the security of these candidates.

2

1

56

Anthony Leverrier

@letonyo

2 years

wonderful lecture notes on bosonic codes by the main zoo keeper @victorvalbert @theeczoo

Bosonic coding: introduction and use cases

Bosonic or continuous-variable coding is a field concerned with robust quantum information processing and communication with electromagnetic signals or mechanical modes. I review bosonic quantum...

arxiv.org

1

5

56

Anthony Leverrier

@letonyo

2 months

indeed, it's never over Chen replies:

Quantum Computing Memes for QMA-Complete Teens

@QuantumMemeing

2 months

it's never been more over

4

8

147

1

55

Anthony Leverrier

@letonyo

5 months

the future of quantum computing!

1

4

53

Anthony Leverrier

@letonyo

1 year

the issue when papers with big claim show up on the arXiv, but details are not provided because of IP issues. The arXiv is here to advance science, it's not an advertising platform.

Craig Gidney

@CraigGidney

1 year

@KikeSolanoPhys @KipuQuantum @QuantinuumQC @GoogleAI Sorry I came off harshly in the last message. I'm just frustrated that you're making a very serious claim and I can't give you to back it up with numbers.

1

0

12

2

3

50

Anthony Leverrier

@letonyo

5 months

Quantum info legend @S_Flammia appointed as the director of the new quantum center at Virginia Tech!

PSIRCH

@PsirchQ

5 months

Congrats to our finalist candidate, Dr. Steve Flammia, and to Virginia Tech and Northrop Grumman. Wishing Steve, Virginia Tech, Northrop Grumman every success with the new #quantum center.

4

6

60

0

1

50

Anthony Leverrier

@letonyo

1 year

#QIP2024 in Taipei, #QIP2025 at Duke University

0

8

50

Anthony Leverrier

@letonyo

2 years

"While quantum computers may still prove useful for quantum chemistry, it may be prudent to assume exponential speedups are not generically available for this problem."

Is there evidence for exponential quantum advantage in quantum chemistry?

The idea to use quantum mechanical devices to simulate other quantum systems is commonly ascribed to Feynman. Since the original suggestion, concrete proposals have appeared for simulating...

arxiv.org

2

11

49

Anthony Leverrier

@letonyo

2 months

and the response by Chen h/t @cryptosaurus6

divesh aggarwal

@diveshaggarwal

2 months

The fun continues.. Omri Shmueli makes a step towards saving the world..

4

26

87

1

4

50

Anthony Leverrier

@letonyo

1 year

So it begins: layoff in the quantum industry. Hopefully quantum hardware companies can find enough incentives for focus on improving gate fidelities, before moving too fast towards elusive applications.

The Quantum Insider

@QuantumDaily

1 year

Rigetti Lays Off 28 Percent of Staff, Focuses on Narrow Quantum Advantage

0

6

18

3

4

50

Anthony Leverrier

@letonyo

5 months

100 logical qubits with 10 000 atoms in 2026. Looking forward to it!

QuEra Computing

@QueraComputing

5 months

We're delighted to announce our three-year quantum computing roadmap, culminating in a neutral-atom computer with 100 logical error-corrected qubits. Read the full release at:

4

44

187

1

0

49

Anthony Leverrier

@letonyo

3 months

The 7th international conference for Young Quantum Information Scientists (YQIS 2024) will take place in Paris on Nov 6-8, 2024.

0

9

48

Anthony Leverrier

@letonyo

2 years

Great to see that IBM preferred approach to (longish-term) quantum error correction involves quantum LDPC codes: " the efficiency benefits are expected to outweigh the long-range connectivity costs"

The Future of Quantum Computing with Superconducting Qubits

For the first time in history, we are seeing a branching point in computing paradigms with the emergence of quantum processing units (QPUs). Extracting the full potential of computation and...

arxiv.org

2

49

Anthony Leverrier

@letonyo

2 years

Very interesting paper by the @MSFTResearch team: @krystasvore While 2D architectures are in principle sufficient, they lead to scary numbers when discussing quantum error correction (1/3)

Assessing requirements to scale to practical quantum advantage

While quantum computers promise to solve some scientifically and commercially valuable problems thought intractable for classical machines, delivering on this promise will require a large-scale...

arxiv.org

2

11

48

Anthony Leverrier

@letonyo

2 years

If you want to know more about the recent breakthoughs in the field of quantum LDPC codes (including the good codes of Panteleev and Kalachev), I'm giving a colloquium in a few hours:

Quantum Colloquium

//--> */ /*-->*/ Tuesday, January 26, 2021 11:00 am – 12:00 pm: Hybrid Classical-Quantum Algorithms, Aram Harrow (MIT) | Abstract | Video Quantum computers offer power to solve some problems that...

simons.berkeley.edu

4

47

Anthony Leverrier

@letonyo

1 year

A nice workshop on novel qubits and bosonic codes starting tomorrow. Perfect time for a preprint with new bosonic codes!

BBQ 2023 - Schedule

Talk titles and Abstracts (PDF download)

sites.google.com

2

6

45

Anthony Leverrier

@letonyo

1 year

A bit frustrated that there is no live-stream of #QIP2023 and not so much live-tweeting either apparently. @qip2023

4

2

48

Anthony Leverrier

@letonyo

3 months

Quantum error correction seems kind of obvious nowadays. But it wasn't always like this. Today I learned from Steve Brierley of @RiverLane_io that Sir Peter Knight almost wrote a paper back in the 90s to say that quantum computing was doomed because of the lack of QEC (1/3)

4

48

Anthony Leverrier

@letonyo

2 years

A nice Quantum article about the recent resolution of the NLTS conjecture

0

4

47

Anthony Leverrier

@letonyo

2 years

The advent of quantum cryptography 40 years ago by Wiesner, Bennett and Brassard led to a new perspective on (low-energy) quantum theory: in particular it is compatible with key distribution but not with bit commitment (1/2)

1

6

46

Anthony Leverrier

@letonyo

3 months

Super interesting paper on QEC for dynamical codes, and a new no-go thm showing that 2D codes with short-range interactions won't let you get low-depth implementations of non-Clifford gates.

1

3

45

Anthony Leverrier

@letonyo

7 months

Anne Canteaut, lauréate 2023 du prestigieux prix Joliot-Curie de la "Femme scientifique de l'année" en France pour ses travaux sur le chiffrement, qualifie de "terrible" la place accordée aux femmes dans les sciences

Femmes et sciences: Anne Canteaut, lauréate de l'année, se désole de la situation

Anne Canteaut, lauréate 2023 du prestigieux prix Joliot-Curie de la "Femme scientifique de l'année" en France pour ses travaux sur le chiffrement, qualifie de "terrible" la place accordée aux femmes…

www.france24.com

2

19

44

Anthony Leverrier

@letonyo

2 years

Relaying a statement by Elham Kashefi: "On the day where all of us in the quantum field are thrilled to celebrate the Nobel prize for the historical achievement of the pioneers of our field, Alain Aspect, John F. Clauser and Anton Zeilinger, (1/2)

1

12

43

Anthony Leverrier

@letonyo

2 years

Exciting trimester program on Error-Correcting Codes at the Simons Institute in Spring 2024, coupled with a quantum computing program!

Error-Correcting Codes: Theory and Practice

This program brings together an interdisciplinary group of researchers to explore the frontiers of the theory and practice of error-correcting codes.

simons.berkeley.edu

0

6

42

Anthony Leverrier

@letonyo

5 months

Now, that's commitment to the rule that a sentence ends with a period, even if there's an equation: (from @quantum_aram 's thesis).

2

1

43

Anthony Leverrier

@letonyo

2 months

@dallairedemers @ChrisPeikert @regevlab it seems that Oded Regev already had a look at a previous version of the manuscript.

1

43

Anthony Leverrier

@letonyo

7 months

The list of accepted talks at QIP is out #QIP2024

1

10

41

Anthony Leverrier

@letonyo

2 years

Terry Tao explains Minkowski spacetime via an analogy based on Tolkien's Middle-Earth:

Special relativity and Middle-Earth

This post is an unofficial sequel to one of my first blog posts from 2007, which was entitled “Quantum mechanics and Tomb Raider”. One of the oldest and most famous allegories is Plato&…

terrytao.wordpress.com

1

7

43

Anthony Leverrier

@letonyo

1 year

Great progress in the field! Here is a very good talk about this result presented at QIP a few weeks ago

QIP2023 | Real-time quantum error correction beyond break-even...

V. V. Sivak, A. Eickbusch, B. Royer, S. Singh, I. Tsioutsios, S. Ganjam, A. Miano, B. L. Brock, A. Z. Ding, L. Frunzio, S. M. Girvin, R. J. Schoelkopf, M. H....

www.youtube.com

nature

@Nature

1 year

Nature research paper: Real-time quantum error correction beyond break-even

3

33

144

1

4

41

Anthony Leverrier

@letonyo

1 year

I guess it was a good idea for the @ibm team not to post their paper on arXiv before submitting to @Nature

James Wootton

@decodoku

1 year

The inevitable classical fightback has begun!

5

4

38

0

1

42

Anthony Leverrier

@letonyo

2 months

Nature just increased their price to 12k€ per open-access article. Paid with taxpayer money at the end of the day.

Dr. Glaucomflecken

@DGlaucomflecken

2 years

Nature does open access

981

29K

91K

2

8

43

Anthony Leverrier

@letonyo

2 years

A nice observation by @nikobreu : applying the "quantum Tanner code" transformation to the surface code gives the "rotated surface code"

3

2

42

Anthony Leverrier

@letonyo

2 years

#HotTake in 50 years, quantum computer will use bosonic codes concatenated with good quantum LDPC codes. What else?

3

5

42

Anthony Leverrier

@letonyo

4 months

Lots of gems like this one in these lecture notes!

Anthony Leverrier

@letonyo

4 months

Wow, the latest draft of Daniel Gottesman's book on quantum error correction is available! A must-read for anyone interested in this field:

3

47

201

1

4

41

Anthony Leverrier

@letonyo

2 years

after the resolution of the quantum LDPC conjecture by Panteleev and Kalachev, it's now the turn of the (combinatorial) NLTS conjecture to fall. Exciting times in QEC and Hamiltonian complexity!

A construction of Combinatorial NLTS

The NLTS (No Low-Energy Trivial State) conjecture of Freedman and Hastings [2014] posits that there exist families of Hamiltonians with all low energy states of high complexity (with complexity...

arxiv.org

1

4

40

Anthony Leverrier

@letonyo

11 months

Why is everyone talking about this paper while there are similar claims all the time, and they never pan out? Is there any hint of something different this time?

The First Room-Temperature Ambient-Pressure Superconductor

For the first time in the world, we succeeded in synthesizing the room-temperature superconductor ($T_c \ge 400$ K, 127$^\circ$C) working at ambient pressure with a modified lead-apatite (LK-99)...

arxiv.org

5

2

38

Anthony Leverrier

@letonyo

1 year

@engineers_feed that Alexei Kitaev has a secret proof that quantum computing cannot work, but won't publish it

0

3

39

Anthony Leverrier

@letonyo

1 year

Super glad to see this result: single-shot decoding of quantum Tanner codes! Good quantum LDPC codes really are the future!

Single-shot decoding of good quantum LDPC codes

Quantum Tanner codes constitute a family of quantum low-density parity-check (LDPC) codes with good parameters, i.e., constant encoding rate and relative distance. In this article, we prove that...

arxiv.org

0

6

37

Anthony Leverrier

@letonyo

2 months

@SunWooPKim yes, precisely

0

38

Anthony Leverrier

@letonyo

7 months

Many quantum experts are also very doubtful about the applications of quantum computing to AI.

Yann LeCun

@ylecun

7 months

By "not any time soon", I mean "clearly not in the next 5 years", contrary to a number of folks in the AI industry. Yes, I'm skeptical of quantum computing, particularly when it comes to its application to AI.

122

160

1K

2

1

37

Anthony Leverrier

@letonyo

2 years

Applications of good quantum LDPC codes outside of quantum computing for fooling many levels of Sum-of-Squares. It will be exciting to understand the properties and consequences of these new mathematical objects!

Explicit Lower Bounds Against $Ω(n)$-Rounds of Sum-of-Squares

We construct an explicit family of 3-XOR instances hard for $Ω(n)$-levels of the Sum-of-Squares (SoS) semi-definite programming hierarchy. Not only is this the first explicit construction to...

arxiv.org

1

2

37

Anthony Leverrier

@letonyo

1 year

Interesting discussion about the 2 papers on "Quantum advantage for combinatorial optimization problems" in the comments on scirate:

0

4

36

Anthony Leverrier

@letonyo

6 months

How such a text can be published in any reputable scientific journal is beyond me. As a "perspective", but still. 🤦

The Quantum House Of Cards

Quantum computers have been proposed to solve a number of important problems such as discovering new drugs, new catalysts for fertilizer production, breaking encryption protocols, optimizing...

arxiv.org

12

3

38

Anthony Leverrier

@letonyo

7 months

listening to a talk by @pasqalio on recent progress in neutral atoms platforms for quantum computing. The speed of improvement (compared to ions and supraconducting qubits) is rather amazing! (Plots by Pascal Scholl)

1

6

35

Anthony Leverrier

@letonyo

1 year

Interesting: Ed Witten teaching a graduate course on physics, including some quantum information theory. With online videos.

Not Even Wrong

@notevenwrong

1 year

New post: Physics With Witten

2

5

23

2

36

Anthony Leverrier

@letonyo

2 years

many of my quantum colleagues also joined me to endorse this statement of solidarity with students in Iran that are sacrificing their entire career and life to redefine the history of Iran. Please join us and be their voice." (2/2)

Statement of solidarity with students in Iran from the international academic community

All authors and signatories represent themselves and not their institutions or employers. On the 2nd of October 2022, the Sharif University of Technology (SUT) in Tehran, one of Iran's top academic...

docs.google.com

0

9

36

Anthony Leverrier

@letonyo

5 months

Public sector investments in quantum technologies source:

4

9

35

Anthony Leverrier

@letonyo

2 years

Some thoughts about multimode bosonic codes for quantum computing. Right now, most bosonic codes are single-mode and correspond to a 2D (for qubits) subspace of an infinite-dim Fock space. (1/n)

2

4

35

Anthony Leverrier

@letonyo

2 years

wow, another independent demonstration of beyond breakeven with with QEC! Amazing! This time, it relies on the binomial code.

Beating the break-even point with a discrete-variable-encoded logical qubit

Quantum error correction (QEC) aims to protect logical qubits from noises by utilizing the redundancy of a large Hilbert space, where an error, once it occurs, can be detected and corrected in...

arxiv.org

0

7

36

Anthony Leverrier

@letonyo

2 years

It's great to see that many leaders of our field are completely open in admitting that they made errors in earlier papers (spoiler: this happens to everyone!). Other inspirational examples: Thomas Vidick

1

0

36

Anthony Leverrier

@letonyo

2 months

@risunabe if your PI is David Baker, that sounds like reasonable advice.

0

35

Anthony Leverrier

@letonyo

2 years

interesting numbers from Martinis' talk about the quality of transistors: 1960: error rate of 10^-3 2020: error rate of 10^-11

Anthony Leverrier

@letonyo

2 years

John Martinis' NISQ threshold conjecture: "quantum computers and simulators can be efficiently (classically) simulated with errors, approx a few percent." => how far are we from proving such a statement?

2

1

22

3

34

Anthony Leverrier

@letonyo

2 years

Wonderful tutorial by @RichardKueng on the randomized measurement toolbox today at the IQFA colloquium. Richard makes it look so nice and simple that it seems extraordinary that these ideas took so long to emerge! (1/2)

1

2

34

Anthony Leverrier

@letonyo

1 year

@chercheur_inf c'est pas déjà le cas pour les concours Inria justement ?

3

0

1

Anthony Leverrier

@letonyo

9 months

kind of amazing that one can take a highly nonlocal quantum LDPC code and massage it into a 3D local codes with optimal parameters. See also here:

Geometrically Local Quantum and Classical Codes from Subdivision

A geometrically local quantum code is an error correcting code situated within $\mathbb{R}^D$, where the checks only act on qubits within a fixed spatial distance. The main question is: What is...

arxiv.org

Dom Williamson

@DomJWilliamson

9 months

Are you a fan of the surface code? Did you ever wish for a similar simple code in three dimensions which had optimal code parameters given the locality constraints? In new work with Nouédyn Baspin, we have just the codes for you!

2

11

98

0

1

34

Anthony Leverrier

@letonyo

2 years

Where I learn that Shor's 3-qubit code had been discovered a decade earlier by Asher Peres

3

1

32

Anthony Leverrier

@letonyo

2 years

The overview talk by Victor Albert @theeczoo is a wonderful resource on recent developments in quantum error correction! Maybe the slides will be available soon?

1

2

32

Anthony Leverrier

@letonyo

2 years

Lots of scientific announcements tomorrow: the Fields medals and the results of the postquantum cryptography process by NIST

1

33

Anthony Leverrier

@letonyo

1 year

the paper is out: with Aurélie Denys, we design codes with interesting groups of "easy to implement" logical gates (think transversal gates, or Gaussian unitaries for bosonic codes). Basically the only requirement is that this group is a unitary 1-design.

Multimode bosonic cat codes with an easily implementable universal gate set

We present a method for designing quantum error correcting codes such that a specific group of logical operations is implemented using simple physical operations such as transversal gates for...

arxiv.org

Anthony Leverrier

@letonyo

1 year

A question for design experts: we know that the Clifford group is a unitary 3-design. But do we know for which n \sum_{U \in Cliff} U^{\otimes n} \otimes U^\dag is non zero? Any reference? @RichardKueng @jenseisert @enclanglement @markusheinrich_ @nechita_ion @quantum_aram

3

0

7

1

4

32

Anthony Leverrier

@letonyo

2 years

as much as I like to think that I'm working on a hard problem, I certainly don't believe that building a QC is the hardest thing humanity has ever tried!

Riverlane

@RiverLane_io

2 years

"Building a quantum computer is probably the hardest thing we've tried as a species" Our mission is to make #quantum computing more useful far sooner than previously imaginable. ▶️Find out more about our mission and how we aim to achieve it here:

0

7

20

4

0

30