Top Tweets for #qLDPC
As @preskill notes, practical quantum computing depends on advances in quantum error correction. This new work on high-rate qLDPC "mitten codes" is a significant step toward scalable fault-tolerant quantum computing. #QuantumComputing #QEC #FTQC #qLDPC Read at https://t.co/60lQkCg3v3
Nearest-neighbour gates are all you need: High-rate quantum low-density parity-check codes on a planar grid
This is a piece of work I am particularly happy with. It shows that many of the advantages of quantum low-density parity-check (#qLDPC) codes can be realized on planar architectures, such as those available in superconducting quantum computing platforms.
https://t.co/tnjU15qn5Q
High-performance quantum low-density parity-check codes promise substantial reductions in the overhead of #faulttolerant quantum computation, but most constructions require long-range connectivity or qubit shuttling, both of which are difficult to realise in superconducting architectures. Here we introduce a family of qLDPC codes that, for the first time, combines planar open-boundary layouts, finite-size advantages over surface codes, and syndrome extraction using only nearest-neighbour gates on a square grid of qubits.
The key idea is to generate check-data connectivity #dynamically: nearest-neighbour #iSWAP walks both define the stabiliser supports and implement their measurement, avoiding the need for a long-range hardware graph. The resulting circuits achieve optimal constant-depth stabiliser measurement, independent of code size, and naturally remove leakage from the system by exchanging the role of check and data qubits at each syndrome extraction round.
We find finite-size instances such as a [[323,14,15]] code, whose code-efficiency ratio is nearly an order of magnitude larger than that of rotated surface-code patches. At around 30 circuit qubits per logical qubit, the best directional tile-code layouts reduce the per-logical per-round logical error rate by up to a factor of 1000 relative to rotated surface-code memories.
These results show that the advantages of quantum low-density parity-check codes can survive compilation into strictly planar nearest-neighbour circuits, bringing low-overhead fault-tolerant memories closer to near-term hardware.
![jenseisert's tweet photo. Nearest-neighbour gates are all you need: High-rate quantum low-density parity-check codes on a planar grid
This is a piece of work I am particularly happy with. It shows that many of the advantages of quantum low-density parity-check (#qLDPC) codes can be realized on planar architectures, such as those available in superconducting quantum computing platforms.
https://t.co/tnjU15qn5Q
High-performance quantum low-density parity-check codes promise substantial reductions in the overhead of #faulttolerant quantum computation, but most constructions require long-range connectivity or qubit shuttling, both of which are difficult to realise in superconducting architectures. Here we introduce a family of qLDPC codes that, for the first time, combines planar open-boundary layouts, finite-size advantages over surface codes, and syndrome extraction using only nearest-neighbour gates on a square grid of qubits.
The key idea is to generate check-data connectivity #dynamically: nearest-neighbour #iSWAP walks both define the stabiliser supports and implement their measurement, avoiding the need for a long-range hardware graph. The resulting circuits achieve optimal constant-depth stabiliser measurement, independent of code size, and naturally remove leakage from the system by exchanging the role of check and data qubits at each syndrome extraction round.
We find finite-size instances such as a [[323,14,15]] code, whose code-efficiency ratio is nearly an order of magnitude larger than that of rotated surface-code patches. At around 30 circuit qubits per logical qubit, the best directional tile-code layouts reduce the per-logical per-round logical error rate by up to a factor of 1000 relative to rotated surface-code memories.
These results show that the advantages of quantum low-density parity-check codes can survive compilation into strictly planar nearest-neighbour circuits, bringing low-overhead fault-tolerant memories closer to near-term hardware.](https://pbs.twimg.com/media/HLJdJ9QWMAAmb5I.jpg)
Quantum just leveled up again.
Quantinuum just demonstrated 48 to 94 logical qubits from roughly 100 physical qubits using high-rate #QLDPC codes.
Fidelity is climbing and performance is moving past break-even territory.
At the same time, Iceberg #Quantum claims its Pinnacle architecture could crack RSA-2048 with fewer than 100,000 physical qubits. The timeline is shrinking fast.
@quipnetwork is building the Worldwide Quantum Computer decentralized access, trustless, designed for speed and efficiency beyond classical limits.
Providers and users together form a global quantum layer for Web3 and beyond.
Backed by #PortalVentures and #OrangeDAO.
The shift is happening.
Who’s joining? 🔥
#QuantumComputing #QuantumResistant #PostQuantum #QuipNetwork #Web3
Can ChatGPT help with research? Maybe not yet for finding new results, but it can already speed up some tedious tasks. An example about quantum Tanner codes #qLDPC Working with qudits (d=5) lets you use nice local codes [4,2,3]_5. Then one should enumerate (1/4)
Localized statistics decoding for quantum low-density parity-check codes
https://t.co/zveRmt1Um0
Quantum low-density parity-check (#qLDPC) codes are a promising candidate for #faulttolerant #quantumcomputing moving much to the attention recently. Indeed, such codes have highly attractive features and considerably reduce overhead compared to the surface code. For this reason, much research effort has been invested into finding such good codes. However, actual fault-tolerant quantum computing is possible only if such codes are accompanied with highly efficient classical decoding algorithms. Indeed, the lack of a practical #decoding algorithm remains a barrier to their implementation.
In this work, we introduce #localizedstatisticsdecoding, a reliability-guided inversion decoder that is highly parallelizable and applicable to arbitrary quantum low-density parity-check codes. Our approach employs a parallel matrix factorization strategy, which we call on-the-fly elimination, to identify, validate, and solve local decoding regions on the decoding graph.
Through numerical simulations, we show that localized statistics decoding matches the performance of state-of-the-art decoders while reducing the runtime complexity for operation in the sub-threshold regime. At the same time, we augment our findings with rigorous statements and assessments involving percolation theory.
Importantly, our decoder is more amenable to implementation on specialized hardware, positioning it as a promising candidate for decoding real-time syndromes from experiments.
I am excited to see this work out in print in @NatureComms.
Warm thanks to the dream team of @timohillmann, Lucas Berent, @armanda_oq, @rbrtwll and @QuantumGizmos for this wonderful collaboration on one of the important topics in #quantumerrorcorrection.
And thanks to our funders, in particular the @bmftr_bund (@QuantenTech), the @dfg_public, @Berlin_Quantum, @ML4Q_cluster, the @MunichQuantum (for which this is yet another Berlin-Munich joint publication), the @QuantumFlagship under @Millenion_Q (for which this is again a Berlin-Munich joint publication) and the @ERC_Research.
I advertise a wonderful paper that came out today by another team in
#quantumerrorcorrection: An experimental demonstration of a distance 3 and 4 #qLDPC code. And it is not just a demonstration but many details are explored.
https://t.co/ymIKBhXbAM
We have our own paper (we are proud of) on Scirate today 😉, but I openly confess that this work is also pretty cool.
ha muerto Marisa paredes.
Las vaKnas hacen estragos
#QLDPC
Lo siento Mucho
Muere el padre de Begoña Gómez, esposa de Pedro Sánchez https://t.co/ULAejCw7b7 a través de @gaceta_es
#QLDPC
#QLDPC
#QLDPC
Great example of an interdisciplinary collaboration: @lucasberent, @timohillmann, @jenseisert, @QuantumGizmos, and I joint forces to improve Bosonic Quantum Low-Density Parity-Check Codes (#QLDPC). The results are now available in @PRX_Quantum.
👉 https://t.co/rb0XX4E3Gj
1/2
Analog information decoding of bosonic quantum low-density parity-check codes
https://t.co/5BYTz8QSar
We present a strategy that makes use of #continuous information in bosonic #QLDPC codes for #quantumerrorcorrection.
#Quantum #LDPC codes decoded with belief propagation don't need to perform poorly. If we use a modified ensemble decoder and an adapted #QLDPC code design, we can mitigate the effects of unavoidable short cycles. #QEC #ErrorCorrection
https://t.co/yjPI415MZk
Nuevos avances en corrección de errores en procesadores cuánticos!
Esto del #qLDPC parece que va a mejorar mucho el rendimiento.
Más de 1000 qbits y contando, el futuro cuántico está a la vuelta de la esquina.
https://t.co/xzOixf2Ghp
@ToroenReposo El karma 😎
#QLDPC
@alfredoblasco @FAADAorg No, no las hay, por eso ninguna ha muerto como este pobre y algunos más 😡
A los que salieron corriendo y dejaron atrás vidas como esta.. también #QLDPC , igual que a @alfredoblasco 🖕
@Espartrugia @blythe_club @Feranhu Yo no veo TV, y de AR sé lo que leía por aquí. Y tal parecía que era una persona razonable en un % bastante alto. Pero aquí la ha cagado al 100 %. No sé, es posible que sea un efecto adverso de la vacuna. Será que a ésta no le tocó placebo. Ahora, por mí, #QLDPC.
Last Seen Hashtags on Sotwe
grandefratello heleners
Seen from Italy
momson(*)(*)(*)(*)(*)(*)(*)(*)(*)(*)**********
TeEnAgEr
รับงานเมืองพล
Seen from Thailand
nolimit()*********** + filter:native_video
Seen from Brazil
chubbygril
Seen from Korea
gooner
Seen from United States
정병
Seen from Korea
รับงานสายไหม
Seen from Thailand
عيزي
Seen from Saudi Arabia
Most Popular Users
Elon Musk 
@elonmusk
241.2M followers
Barack Obama
@barackobama
119.1M followers
Cristiano Ronaldo
@cristiano
112.6M followers
Donald J. Trump
@realdonaldtrump
111.8M followers
Narendra Modi
@narendramodi
107.1M followers
Rihanna
@rihanna
98.2M followers
NASA
@nasa
92.2M followers
Justin Bieber
@justinbieber
91.4M followers
KATY PERRY
@katyperry
88.8M followers
Taylor Swift
@taylorswift13
82.7M followers
Lady Gaga
@ladygaga
74.2M followers
Virat Kohli
@imvkohli
71.7M followers
Kim Kardashian
@kimkardashian
70.3M followers
YouTube
@youtube
68.7M followers
Neymar Jr
@neymarjr
64.6M followers
Bill Gates
@billgates
64.5M followers
The Ellen Show
@theellenshow
62.4M followers
Selena Gomez
@selenagomez
61.9M followers
CNN
@cnn
61.8M followers
X
@x
60.8M followers