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

Efficient quantum Gibbs sampling of stabilizer codes using hybrid computation di Shum, Ivan H. C., Capel, Angela

Sommario: “...We present hybrid Gibbs sampling algorithms for the stabilizer code Hamiltonians of the rotated...”
Testo

New bounds for codes over Gaussian integers based on the Mannheim distance di Shi, Minjia, Wang, Xuan, An, Junmin, Kim, Jon-Lark

Sommario: “... regions using a Mannheim version of the Macwilliams-type identity. Finally, we present decoding algorithms...”
Testo

Eulerian orientations and Hadamard codes: A novel connection via counting di Shao, Shuai, Tang, Zhuxiao

Sommario: “... and Hadamard codes by studying the counting problem of Eulerian orientations (\#EO) with local constraint...”
Testo

BIGSTICK: A flexible configuration-interaction shell-model code (updated) di Johnson, Calvin W., Ormand, W. Erich, McElvain, Kenneth S., Zbikowski, Ryan, Shan, Hongzhang

Sommario: “...We present BIGSTICK, a flexible configuration-interaction open-source shell-model code for the many...”
Testo

Adaptive Voxelization for Transform coding of 3D Gaussian splatting data di Wang, Chenjunjie, Sridhara, Shashank N., Pavez, Eduardo, Ortega, Antonio, Chang, Cheng

Sommario: “... coding efficiency while enabling the use of fast transform coding algorithms. We propose an adaptive...”
Testo

Assessing LLM code generation quality through path planning tasks di Chen, Wanyi, Su, Meng-Wen, Cummings, Mary L.

Sommario: “... assessed six LLMs' abilities to generate the code for three different path-planning algorithms and tested...”
Testo

Enhancement by postfiltering for speech and audio coding in ad-hoc sensor networks di Das, Sneha, Bäckström, Tom

Sommario: “...Enhancement algorithms for wireless acoustics sensor networks~(WASNs) are indispensable...”
Testo

Flag at origin: a modular fault-tolerant preparation for CSS codes di Forlivesi, Diego, Amaro, David

Sommario: “... (QEC) codes is essential for FT computation. Existing constructions of these FT circuits are often...”
Testo

HFBTHO-AD: Differentiation of a nuclear energy density functional code di Hascoët, Laurent, Menickelly, Matt, Narayanan, Sri Hari Krishna, O'Neal, Jared, Schunck, Nicolas, Wild, Stefan M.

Sommario: “... of the energy functional, which are a subset of all input parameters of the code. We use the algorithmic...”
Testo

On general self-orthogonal matrix-product codes associated with Toeplitz matrices di Li, Yang, Zhu, Shixin, Martínez-Moro, Edgar

Sommario: “...In this paper, we present four constructions of {general} self-orthogonal matrix-product codes...”
Testo

Fault-tolerant simulation of Lattice Gauge Theories with gauge covariant codes di Spagnoli, L., Roggero, A., Wiebe, N.

Sommario: “... by blurring the lines between simulation algorithms and quantum error correcting codes. ...”
Testo

Fault-tolerant quantum computing with the parity code and noise-biased qubits di Messinger, Anette, Torggler, Valentin, Klaver, Berend, Fellner, Michael, Lechner, Wolfgang

Sommario: “... interactions. The code layout can be dynamically adjusted to algorithmic requirements on-the-fly. This allows...”
Testo

Indirect Job-Shop coding using rank: application to QAOA (IQAOA) di Bourreau, Eric, Fleury, Gerard, Lacomme, Phlippe

Sommario: “... graph, with earliest starting times computed using a longest path algorithm. The complexity of solving...”
Testo

Near-term $n$ to $k$ distillation protocols using graph codes di Goodenough, Kenneth, de Bone, Sébastian, Addala, Vaishnavi L., Krastanov, Stefan, Jansen, Sarah, Gijswijt, Dion, Elkouss, David

Sommario: “... on the input states, we find a correspondence between these distillation protocols and graph codes. We leverage...”
Testo

Improved bounds on the size of permutation codes under Kendall $τ$-metric di Parvaresh, Farzad, Sobhani, Reza, Abdollahi, Alireza, Bagherian, Javad, Jafari, Fatemeh, Khatami, Maryam

Sommario: “... the largest size $P(n, d)$ of permutation codes of length $n$, i.e., subsets of the set $S_n$ of all...”
Testo

Suppressing quantum errors by scaling a surface code logical qubit di Acharya, Rajeev, Aleiner, Igor, Allen, Richard, Andersen, Trond I., Ansmann, Markus, Arute, Frank, Arya, Kunal, Asfaw, Abraham, Atalaya, Juan, Babbush, Ryan, Bacon, Dave, Bardin, Joseph C., Basso, Joao, Bengtsson, Andreas, Boixo, Sergio, Bortoli, Gina, Bourassa, Alexandre, Bovaird, Jenna, Brill, Leon, Broughton, Michael, Buckley, Bob B., Buell, David A., Burger, Tim, Burkett, Brian, Bushnell, Nicholas, Chen, Yu, Chen, Zijun, Chiaro, Ben, Cogan, Josh, Collins, Roberto, Conner, Paul, Courtney, William, Crook, Alexander L., Curtin, Ben, Debroy, Dripto M., Barba, Alexander Del Toro, Demura, Sean, Dunsworth, Andrew, Eppens, Daniel, Erickson, Catherine, Faoro, Lara, Farhi, Edward, Fatemi, Reza, Burgos, Leslie Flores, Forati, Ebrahim, Fowler, Austin G., Foxen, Brooks, Giang, William, Gidney, Craig, Gilboa, Dar, Giustina, Marissa, Dau, Alejandro Grajales, Gross, Jonathan A., Habegger, Steve, Hamilton, Michael C., Harrigan, Matthew P., Harrington, Sean D., Higgott, Oscar, Hilton, Jeremy, Hoffmann, Markus, Hong, Sabrina, Huang, Trent, Huff, Ashley, Huggins, William J., Ioffe, Lev B., Isakov, Sergei V., Iveland, Justin, Jeffrey, Evan, Jiang, Zhang, Jones, Cody, Juhas, Pavol, Kafri, Dvir, Kechedzhi, Kostyantyn, Kelly, Julian, Khattar, Tanuj, Khezri, Mostafa, Kieferová, Mária, Kim, Seon, Kitaev, Alexei, Klimov, Paul V., Klots, Andrey R., Korotkov, Alexander N., Kostritsa, Fedor, Kreikebaum, John Mark, Landhuis, David, Laptev, Pavel, Lau, Kim-Ming, Laws, Lily, Lee, Joonho, Lee, Kenny, Lester, Brian J., Lill, Alexander, Liu, Wayne, Locharla, Aditya, Lucero, Erik, Malone, Fionn D., Marshall, Jeffrey, Martin, Orion, McClean, Jarrod R., Mccourt, Trevor, McEwen, Matt, Megrant, Anthony, Costa, Bernardo Meurer, Mi, Xiao, Miao, Kevin C., Mohseni, Masoud, Montazeri, Shirin, Morvan, Alexis, Mount, Emily, Mruczkiewicz, Wojciech, Naaman, Ofer, Neeley, Matthew, Neill, Charles, Nersisyan, Ani, Neven, Hartmut, Newman, Michael, Ng, Jiun How, Nguyen, Anthony, Nguyen, Murray, Niu, Murphy Yuezhen, O'Brien, Thomas E., Opremcak, Alex, Platt, John, Petukhov, Andre, Potter, Rebecca, Pryadko, Leonid P., Quintana, Chris, Roushan, Pedram, Rubin, Nicholas C., Saei, Negar, Sank, Daniel, Sankaragomathi, Kannan, Satzinger, Kevin J., Schurkus, Henry F., Schuster, Christopher, Shearn, Michael J., Shorter, Aaron, Shvarts, Vladimir, Skruzny, Jindra, Smelyanskiy, Vadim, Smith, W. Clarke, Sterling, George, Strain, Doug, Szalay, Marco, Torres, Alfredo, Vidal, Guifre, Villalonga, Benjamin, Heidweiller, Catherine Vollgraff, White, Theodore, Xing, Cheng, Yao, Z. Jamie, Yeh, Ping, Yoo, Juhwan, Young, Grayson, Zalcman, Adam, Zhang, Yaxing, Zhu, Ningfeng

Sommario: “... with physical qubits. Quantum error correction offers a path to algorithmically-relevant error rates by encoding...”
Testo

Assessing objective quality metrics for JPEG and MPEG point cloud coding di Lazzarotto, Davi, Testolina, Michela, Ebrahimi, Touradj

Sommario: “...-based point cloud coding. Each of the standards mentioned above is based on a different algorithm...”
Testo

LDPC-cat codes for low-overhead quantum computing in 2D di Ruiz, Diego, Guillaud, Jérémie, Leverrier, Anthony, Mirrahimi, Mazyar, Vuillot, Christophe

Sommario: “... with the best encoding rate for algorithmically relevant code distances. We discover that some of the best codes...”
Testo

One Code Fits All: Strong stuck-at codes for versatile memory encoding di Con, Roni, Gabrys, Ryan, Yaakobi, Eitan

Sommario: “... and decoding algorithms that get arbitrarily close to capacity in this scenario. Furthermore, to the best...”
Testo

Validation of alopecia coding in US claims data among women of childbearing age di Maria C. Schneeweiss, Arash Mostaghimi, Stephanie Chiuve, Sebastian Schneeweiss, Priyanka Anand, Katharina Schoder, Theresa Oduol, Carrie Huisingh, Kueiyu Joshua Lin

Sommario: “... algorithm variations, stratified by race.ResultsOut of 300 patients with at least 1 ICD‐10 code for alopecia...”
Testo