Zobrazeno 1 - 10
of 454
pro vyhledávání: '"P. Laneve"'
Autor:
Laneve, Alessandro, Ronco, Giuseppe, Beccaceci, Mattia, Barigelli, Paolo, Salusti, Francesco, Claro-Rodriguez, Nicolas, De Pascalis, Giorgio, Suprano, Alessia, Chiaudano, Leone, Schöll, Eva, Hanschke, Lukas, Krieger, Tobias M., Buchinger, Quirin, da Silva, Saimon F. Covre, Neuwirth, Julia, Stroj, Sandra, Höfling, Sven, Huber-Loyola, Tobias, Castaneda, Mario A. Usuga, Carvacho, Gonzalo, Spagnolo, Nicolò, Rota, Michele B., Basset, Francesco Basso, Rastelli, Armando, Sciarrino, Fabio, Jöns, Klaus, Trotta, Rinaldo
Photonic quantum information processing in metropolitan quantum networks lays the foundation for cloud quantum computing [1, 2], secure communication [3, 4], and the realization of a global quantum internet [5, 6]. This paradigm shift requires on-dem
Externí odkaz:
http://arxiv.org/abs/2411.12387
Autor:
Laneve, Alessandro, Rota, Michele B., Basset, Francesco Basso, Beccaceci, Mattia, Villari, Valerio, Oberleitner, Thomas, Reum, Yorick, Krieger, Tobias M., Buchinger, Quirin, da Silva, Saimon F. Covre, Pfenning, Andreas, Stroj, Sandra, Höfling, Sven, Rastelli, Armando, Huber-Loyola, Tobias, Trotta, Rinaldo
The generation of entangled photons from radiative cascades has enabled milestone experiments in quantum information science with several applications in photonic quantum technologies. Significant efforts are being devoted to pushing the performances
Externí odkaz:
http://arxiv.org/abs/2409.07875
Autor:
Laneve, Lorenzo, Wolf, Stefan
Quantum signal processing (QSP) is a framework which was proven to unify and simplify a large number of known quantum algorithms, as well as discovering new ones. QSP allows one to transform a signal embedded in a given unitary using polynomials. Cha
Externí odkaz:
http://arxiv.org/abs/2407.20823
Autor:
Laneve, Lorenzo
Quantum signal processing (QSP) and the quantum singular value transformation (QSVT) are pivotal tools for simplifying the development of quantum algorithms. These techniques leverage polynomial transformations on the eigenvalues or singular values o
Externí odkaz:
http://arxiv.org/abs/2311.03949
Autor:
De Palma, Giuseppe, Giallorenzo, Saverio, Laneve, Cosimo, Mauro, Jacopo, Trentin, Matteo, Zavattaro, Gianluigi
Publikováno v:
EPTCS 392, 2023, pp. 40-52
Current proprietary and open-source serverless platforms follow opinionated, hardcoded scheduling policies to deploy the functions to be executed over the available workers. Such policies may decrease the performance and the security of the applicati
Externí odkaz:
http://arxiv.org/abs/2310.20391
Autor:
Laneve, Lorenzo
Black-box quantum-state preparation is a variant of quantum-state preparation where we want to construct an $n$-qubit state $|\psi_c\rangle \propto \sum_x c(x) |x\rangle$ with the amplitudes $c(x)$ given as a (quantum) oracle. This variant is particu
Externí odkaz:
http://arxiv.org/abs/2305.04705
Autor:
Laneve, Lorenzo
Quantum Signal Processing (QSP) is a technique that can be used to implement a polynomial transformation $P(x)$ applied to the eigenvalues of a unitary $U$, essentially implementing the operation $P(U)$, provided that $P$ satisfies some conditions th
Externí odkaz:
http://arxiv.org/abs/2303.11077
Publikováno v:
Frontiers in Plant Science, Vol 15 (2024)
Externí odkaz:
https://doaj.org/article/bff45f0f0f964a38b30c5808514d22ef
Autor:
Francesco Rossi, Raffaele Casa, Wenjiang Huang, Giovanni Laneve, Liu Linyi, Saham Mirzaei, Simone Pascucci, Stefano Pignatti, Ren Yu
Publikováno v:
Geo-spatial Information Science, Vol 27, Iss 3, Pp 870-891 (2024)
This research investigates the suitability of PRISMA and Sentinel-2 satellite imagery for retrieving topsoil properties such as Organic Matter (OM), Nitrogen (N), Phosphorus (P), Potassium (K), and pH in croplands using different Machine Learning (ML
Externí odkaz:
https://doaj.org/article/70f7da619fa1482a9ee3f04032827866
Publikováno v:
Quantum 7, 1056 (2023)
Random walks (or Markov chains) are models extensively used in theoretical computer science. Several tools, including analysis of quantities such as hitting and mixing times, are helpful for devising randomized algorithms. A notable example is Sch\"o
Externí odkaz:
http://arxiv.org/abs/2210.10188