Zobrazeno 1 - 10
of 246
pro vyhledávání: '"Høyer, Peter"'
Autor:
Li, Jianning, Zhou, Zongwei, Yang, Jiancheng, Pepe, Antonio, Gsaxner, Christina, Luijten, Gijs, Qu, Chongyu, Zhang, Tiezheng, Chen, Xiaoxi, Li, Wenxuan, Wodzinski, Marek, Friedrich, Paul, Xie, Kangxian, Jin, Yuan, Ambigapathy, Narmada, Nasca, Enrico, Solak, Naida, Melito, Gian Marco, Vu, Viet Duc, Memon, Afaque R., Schlachta, Christopher, De Ribaupierre, Sandrine, Patel, Rajnikant, Eagleson, Roy, Chen, Xiaojun, Mächler, Heinrich, Kirschke, Jan Stefan, de la Rosa, Ezequiel, Christ, Patrick Ferdinand, Li, Hongwei Bran, Ellis, David G., Aizenberg, Michele R., Gatidis, Sergios, Küstner, Thomas, Shusharina, Nadya, Heller, Nicholas, Andrearczyk, Vincent, Depeursinge, Adrien, Hatt, Mathieu, Sekuboyina, Anjany, Löffler, Maximilian, Liebl, Hans, Dorent, Reuben, Vercauteren, Tom, Shapey, Jonathan, Kujawa, Aaron, Cornelissen, Stefan, Langenhuizen, Patrick, Ben-Hamadou, Achraf, Rekik, Ahmed, Pujades, Sergi, Boyer, Edmond, Bolelli, Federico, Grana, Costantino, Lumetti, Luca, Salehi, Hamidreza, Ma, Jun, Zhang, Yao, Gharleghi, Ramtin, Beier, Susann, Sowmya, Arcot, Garza-Villarreal, Eduardo A., Balducci, Thania, Angeles-Valdez, Diego, Souza, Roberto, Rittner, Leticia, Frayne, Richard, Ji, Yuanfeng, Ferrari, Vincenzo, Chatterjee, Soumick, Dubost, Florian, Schreiber, Stefanie, Mattern, Hendrik, Speck, Oliver, Haehn, Daniel, John, Christoph, Nürnberger, Andreas, Pedrosa, João, Ferreira, Carlos, Aresta, Guilherme, Cunha, António, Campilho, Aurélio, Suter, Yannick, Garcia, Jose, Lalande, Alain, Vandenbossche, Vicky, Van Oevelen, Aline, Duquesne, Kate, Mekhzoum, Hamza, Vandemeulebroucke, Jef, Audenaert, Emmanuel, Krebs, Claudia, van Leeuwen, Timo, Vereecke, Evie, Heidemeyer, Hauke, Röhrig, Rainer, Hölzle, Frank, Badeli, Vahid, Krieger, Kathrin, Gunzer, Matthias, Chen, Jianxu, van Meegdenburg, Timo, Dada, Amin, Balzer, Miriam, Fragemann, Jana, Jonske, Frederic, Rempe, Moritz, Malorodov, Stanislav, Bahnsen, Fin H., Seibold, Constantin, Jaus, Alexander, Marinov, Zdravko, Jaeger, Paul F., Stiefelhagen, Rainer, Santos, Ana Sofia, Lindo, Mariana, Ferreira, André, Alves, Victor, Kamp, Michael, Abourayya, Amr, Nensa, Felix, Hörst, Fabian, Brehmer, Alexander, Heine, Lukas, Hanusrichter, Yannik, Weßling, Martin, Dudda, Marcel, Podleska, Lars E., Fink, Matthias A., Keyl, Julius, Tserpes, Konstantinos, Kim, Moon-Sung, Elhabian, Shireen, Lamecker, Hans, Zukić, Dženan, Paniagua, Beatriz, Wachinger, Christian, Urschler, Martin, Duong, Luc, Wasserthal, Jakob, Hoyer, Peter F., Basu, Oliver, Maal, Thomas, Witjes, Max J. H., Schiele, Gregor, Chang, Ti-chiun, Ahmadi, Seyed-Ahmad, Luo, Ping, Menze, Bjoern, Reyes, Mauricio, Deserno, Thomas M., Davatzikos, Christos, Puladi, Behrus, Fua, Pascal, Yuille, Alan L., Kleesiek, Jens, Egger, Jan
Prior to the deep learning era, shape was commonly used to describe the objects. Nowadays, state-of-the-art (SOTA) algorithms in medical imaging are predominantly diverging from computer vision, where voxel grids, meshes, point clouds, and implicit s
Externí odkaz:
http://arxiv.org/abs/2308.16139
Autor:
Høyer, Peter, Leahy, Janet
The defining feature of memoryless quantum walks is that they operate on the vertex space of a graph, and therefore can be used to produce search algorithms with minimal memory. We present a memoryless walk that can find a unique marked vertex on a t
Externí odkaz:
http://arxiv.org/abs/2204.09076
Publikováno v:
Phys. Rev. Research, Vol 4, page 023237, 2022
The System of Linear Equations Problem (SLEP) is specified by a complex invertible matrix $A$, the condition number $\kappa$ of $A$, a vector $b$, a Hermitian matrix $M$ and an accuracy $\epsilon$, and the task is to estimate $x^\dagger Mx$, where $x
Externí odkaz:
http://arxiv.org/abs/2111.10485
Autor:
Chakraborty, Sourav, Chattopadhyay, Arkadev, Høyer, Peter, Mande, Nikhil S., Paraashar, Manaswi, de Wolf, Ronald
Buhrman, Cleve and Wigderson (STOC'98) showed that for every Boolean function f : {-1,1}^n to {-1,1} and G in {AND_2, XOR_2}, the bounded-error quantum communication complexity of the composed function f o G equals O(Q(f) log n), where Q(f) denotes t
Externí odkaz:
http://arxiv.org/abs/2012.05233
Autor:
Høyer, Peter, Yu, Zhan
Publikováno v:
Quantum Information and Computation, Vol. 20, No. 13-14 (2020) 1137-1152
The lackadaisical quantum walk is a quantum analogue of the lazy random walk obtained by adding a self-loop to each vertex in the graph. We analytically prove that lackadaisical quantum walks can find a unique marked vertex on any regular locally arc
Externí odkaz:
http://arxiv.org/abs/2002.11234
Autor:
Unnersjö-Jess, David, Butt, Linus, Höhne, Martin, Sergei, German, Fatehi, Arash, Witasp, Anna, Wernerson, Annika, Patrakka, Jaakko, Hoyer, Peter F., Blom, Hans, Schermer, Bernhard, Bozek, Katarzyna, Benzing, Thomas
Publikováno v:
In Kidney International June 2023 103(6):1120-1130
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Koehler, Sybille, Odenthal, Johanna, Ludwig, Vivian, Unnersjö Jess, David, Höhne, Martin, Jüngst, Christian, Grawe, Ferdi, Helmstädter, Martin, Janku, Johanna L., Bergmann, Carsten, Hoyer, Peter F., Hagmann, H. Henning, Walz, Gerd, Bloch, Wilhelm, Niessen, Carien, Schermer, Bernhard, Wodarz, Andreas, Denholm, Barry, Benzing, Thomas, Iden, Sandra, Brinkkoetter, Paul T.
Publikováno v:
In Kidney International April 2022 101(4):733-751
Autor:
Belovs, Aleksandrs, Brassard, Gilles, Hoyer, Peter, Kaplan, Marc, Laplante, Sophie, Salvail, Louis
Publikováno v:
Proceedings of 12th Conference on Theory of Quantum Computation, Communication and Cryptography (TQC), Paris, June 2017
At Crypto 2011, some of us had proposed a family of cryptographic protocols for key establishment capable of protecting quantum and classical legitimate parties unconditionally against a quantum eavesdropper in the query complexity model. Unfortunate
Externí odkaz:
http://arxiv.org/abs/1704.08182
Autor:
Hoyer, Peter, Komeili, Mojtaba
Publikováno v:
34th Symposium on Theoretical Aspects of Computer Science (STACS), vol 66 of LIPIcs, pp. 42:1-42:14, 2017
We give a quantum algorithm for finding a marked element on the grid when there are multiple marked elements. Our algorithm uses quadratically fewer steps than a random walk on the grid, ignoring logarithmic factors. This is the first known quantum w
Externí odkaz:
http://arxiv.org/abs/1612.08958