Zobrazeno 1 - 10
of 209
pro vyhledávání: '"Tremblay, Maxime A."'
Autor:
Hopfmueller, Florian, Tremblay, Maxime, St-Jean, Philippe, Royer, Baptiste, Lemonde, Marc-Antoine
Publikováno v:
Quantum 8, 1539 (2024)
A promising route towards fault-tolerant quantum error correction is the concatenation of a Gottesman-Kitaev-Preskill (GKP) code with a qubit code. Development of such concatenated codes requires simulation tools which realistically model noise, whil
Externí odkaz:
http://arxiv.org/abs/2402.09333
Autor:
Lachance-Quirion, Dany, Lemonde, Marc-Antoine, Simoneau, Jean Olivier, St-Jean, Lucas, Lemieux, Pascal, Turcotte, Sara, Wright, Wyatt, Lacroix, Amélie, Fréchette-Viens, Joëlle, Shillito, Ross, Hopfmueller, Florian, Tremblay, Maxime, Frattini, Nicholas E., Lemyre, Julien Camirand, St-Jean, Philippe
The Gottesman-Kitaev-Preskill (GKP) code encodes a logical qubit into a bosonic system with resilience against single-photon loss, the predominant error in most bosonic systems. Here we present experimental results demonstrating quantum error correct
Externí odkaz:
http://arxiv.org/abs/2310.11400
Publikováno v:
Quantum 7, 985 (2023)
We introduce a methodology for generating random multi-qubit stabilizer codes based on solving a constraint satisfaction problem (CSP) on random bipartite graphs. This framework allows us to enforce stabilizer commutation, $X/Z$ balancing, finite rat
Externí odkaz:
http://arxiv.org/abs/2207.03562
Autor:
Watson, Christopher J, Mazzei, Renata, Bourgeois, Bérenger, Smedbol, Élise, Guiraud, Noé, Félix-Faure, Jim, Damar, Hada, Tremblay, Maxime, Bordeleau, Pierre-Andé, Vaillancourt, Mathieu, Bertolo, Andrea, Cabana, Gilbert, Campeau, Stephane, Doyon, Maurice, Fournier, Valérie, Fugère, Vincent, Gravel, Valérie, Guillemette, François, Halde, Caroline, Head, Jessica A, Kallenbach, Cynthia M, Lewis, Nathalie, Maire, Vincent, Mundler, Patrick, Poulin, Monique, Prasher, Shiv O, Qi, Zhiming, Rodriguez, Marco A, Roy, Alexandre, Roy, Denis, Ruiz, Julie, von Sperber, Christian, Tamini, Lota D, Seguin, Philippe, Vanasse, Anne, Proulx, Raphaël
Publikováno v:
In Basic and Applied Ecology November 2024 80:11-22
Quantum LDPC codes may provide a path to build low-overhead fault-tolerant quantum computers. However, as general LDPC codes lack geometric constraints, na\"ive layouts couple many distant qubits with crossing connections which could be hard to build
Externí odkaz:
http://arxiv.org/abs/2109.14609
In this work we establish lower bounds on the size of Clifford circuits that measure a family of commuting Pauli operators. Our bounds depend on the interplay between a pair of graphs: the Tanner graph of the set of measured Pauli operators, and the
Externí odkaz:
http://arxiv.org/abs/2109.14599
Autor:
LaRose, Ryan, Mari, Andrea, Kaiser, Sarah, Karalekas, Peter J., Alves, Andre A., Czarnik, Piotr, Mandouh, Mohamed El, Gordon, Max H., Hindy, Yousef, Robertson, Aaron, Thakre, Purva, Wahl, Misty, Samuel, Danny, Mistri, Rahul, Tremblay, Maxime, Gardner, Nick, Stemen, Nathaniel T., Shammah, Nathan, Zeng, William J.
Publikováno v:
Quantum 6, 774 (2022)
We introduce Mitiq, a Python package for error mitigation on noisy quantum computers. Error mitigation techniques can reduce the impact of noise on near-term quantum computers with minimal overhead in quantum resources by relying on a mixture of quan
Externí odkaz:
http://arxiv.org/abs/2009.04417
Rain fills the atmosphere with water particles, which breaks the common assumption that light travels unaltered from the scene to the camera. While it is well-known that rain affects computer vision algorithms, quantifying its impact is difficult. In
Externí odkaz:
http://arxiv.org/abs/2009.03683
Publikováno v:
Canadian Journal of Physics 99 (4) (2021)
Cet article se veut un survol des r\'eseaux de tenseurs et s'adresse aux d\'ebutants en la mati\`ere. Nous y mettons l'accent sur les outils n\'ecessaires \`a l'impl\'ementation concr\`ete d'algorithmes. Quatre op\'erations de base (remodelage, permu
Externí odkaz:
http://arxiv.org/abs/1911.11566
Arikan's recursive code construction is designed to polarize a collection of memoryless channels into a set of good and a set of bad channels, and it can be efficiently decoded using successive cancellation. It was recently shown that the same constr
Externí odkaz:
http://arxiv.org/abs/1805.09378