Risultati della ricerca - decoding ((algorithmics OR algorithm) OR (algorithm OR (algorithm OR algorithm)))

Nonlocal decoding of positional and correlational information during development di Zhang, Alex Chen Yi, Hoyos, Pablo Mateu, Brückner, David, Tkačik, Gašper

Sommario: “... bounds on positional information gain due to nonlocal readout and identify signal processing algorithms...”
Testo

Union-find quantum decoding without union-find di Griffiths, Sam J., Browne, Dan E.

Sommario: “...The union-find decoder is a leading algorithmic approach to the correction of quantum errors...”
Testo

Single-shot decoding of good quantum LDPC codes di Gu, Shouzhen, Tang, Eugene, Caha, Libor, Choe, Shin Ho, He, Zhiyang, Kubica, Aleksander

Sommario: “... multiple repeated rounds of QEC, it suffices to run the parallel decoding algorithm for constant time...”
Testo

Optimal adaptation of surface-code decoders to local noise di Darmawan, Andrew S.

Sommario: “... decoding algorithms to improve the performance of quantum error-correcting codes. Focusing on the surface...”
Testo

Limitations of the decoding-to-LPN reduction via code smoothing di Pathegama, Madhura, Barg, Alexander

Sommario: “.... Researchers have attempted to demonstrate the algorithmic hardness of this problem by finding reductions from...”
Testo

Breadth-first graph traversal union-find decoder di Löbl, Matthias C., Chen, Susan X., Paesani, Stefano, Sørensen, Anders S.

Sommario: “...Fast decoding algorithms are decisive for real-time quantum error correction and for analyzing...”
Testo

Real-time decoding of the gross code memory with FPGAs di Maurer, Thilo, Bühler, Markus, Kröner, Michael, Haverkamp, Frank, Müller, Tristan, Vandeth, Drew, Johnson, Blake R.

Sommario: “...We introduce a prototype FPGA decoder implementing the recently discovered Relay-BP algorithm...”
Testo

Hardness results for decoding the surface code with Pauli noise di Fischer, Alex, Miyake, Akimasa

Sommario: “... correction more effectively if our decoding algorithms take into account this prior information about...”
Testo

Analog information decoding of bosonic quantum LDPC codes di Berent, Lucas, Hillmann, Timo, Eisert, Jens, Wille, Robert, Roffe, Joschka

Sommario: “... analog single-shot decoding method. Our results lay the foundation for general decoding algorithms using...”
Testo

Error mitigation for logical circuits using decoder confidence di Dincă, Maria, Chan, Tim, Benjamin, Simon C.

Sommario: “...Fault-tolerant quantum computers use decoders to monitor for errors and find a plausible correction...”
Testo

Learning efficient decoders for quasi-chaotic quantum scramblers di Leone, Lorenzo, Oliviero, Salvatore F. E., Lloyd, Seth, Hamma, Alioscia

Sommario: “... the scrambled information even without any previous knowledge of the scrambler, by a learning algorithm...”
Testo

Spatially parallel decoding for multi-qubit lattice surgery di Lin, Sophia Fuhui, Peterson, Eric C., Sankar, Krishanu, Sivarajah, Prasahnt

Sommario: “...Running quantum algorithms protected by quantum error correction requires a real time, classical...”
Testo

Data assimilation and discrepancy modeling with shallow recurrent decoders di Bao, Yuxuan, Kutz, J. Nathan

Sommario: “... variables using real sensor data to accurately reconstruct the full system state. Furthermore, our algorithm...”
Testo

Sequential decoding of the XYZ$^2$ hexagonal stabilizer code di Srivastava, Basudha, Xiao, Yinzi, Kockum, Anton Frisk, Criger, Ben, Granath, Mats

Sommario: “...Quantum error correction requires accurate and efficient decoding to optimally suppress errors...”
Testo

Permutation decoding of first-order Generalized Reed-Muller codes di Bernal, José Joaquín, Simón, Juan Jacobo

Sommario: “...In [4] we describe a variation of the classical permutation decoding algorithm that can be applied...”
Testo

Generalized LDPC codes with low-complexity decoding and fast convergence di Simegn, Dawit, Artemasov, Dmitry, Andreev, Kirill, Rybin, Pavel, Frolov, Alexey

Sommario: “... of Cordaro-Wagner codes. Two efficient decoding algorithms are proposed: one based on Hartmann-Rudolph...”
Testo

Fractional decoding of algebraic geometry codes over extension fields di Camps-Moreno, Eduardo, Matthews, Gretchen L., Santos, Welington

Sommario: “... projections to provide fractional decoding algorithms for the codes over $\mathbb{F}_{q^\ell}$. Fractional...”
Testo

Tight inapproximability of max-LINSAT and implications for decoded quantum interferometry di Kramer, Maximilian J., Schubert, Carsten, Eisert, Jens

Sommario: “.... Specifically, we prove by a direct reduction from Håstad's theorem that no polynomial-time algorithm can exceed...”
Testo

Approximate maximum likelihood decoding with $K$ minimum weight matchings di Lin, Mao

Sommario: “... more computationally expensive compared to the MWM decoder. In this work, we introduce an algorithm...”
Testo

A blindness property of the Min-Sum decoding for the toric code di Crest, Julien du, Mhalla, Mehdi, Savin, Valentin

Sommario: “... message-passing decoding, a class of low-complexity, iterative decoding algorithms that play a central...”
Testo