Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Wierichs, David"'
Symmetries are crucial for tailoring parametrized quantum circuits to applications, due to their capability to capture the essence of physical systems. In this work, we shift the focus away from incorporating symmetries in the circuit design and towa
Externí odkaz:
http://arxiv.org/abs/2312.06752
The discovery of the backpropagation algorithm ranks among one of the most important moments in the history of machine learning, and has made possible the training of large-scale neural networks through its ability to compute gradients at roughly the
Externí odkaz:
http://arxiv.org/abs/2306.14962
Publikováno v:
Quantum 8, 1275 (2024)
Variational quantum algorithms use non-convex optimization methods to find the optimal parameters for a parametrized quantum circuit in order to solve a computational problem. The choice of the circuit ansatz, which consists of parameterized gates, i
Externí odkaz:
http://arxiv.org/abs/2303.11355
Publikováno v:
Quantum 6, 677 (2022)
Variational quantum algorithms are ubiquitous in applications of noisy intermediate-scale quantum computers. Due to the structure of conventional parametrized quantum gates, the evaluated functions typically are finite Fourier series of the input par
Externí odkaz:
http://arxiv.org/abs/2107.12390
Autor:
Hubregtsen, Thomas, Wierichs, David, Gil-Fuster, Elies, Derks, Peter-Jan H. S., Faehrmann, Paul K., Meyer, Johannes Jakob
Publikováno v:
Phys. Rev. A 106, 042431 (2022)
Kernel methods are a cornerstone of classical machine learning. The idea of using quantum computers to compute kernels has recently attracted attention. Quantum embedding kernels (QEKs) constructed by embedding data into the Hilbert space of a quantu
Externí odkaz:
http://arxiv.org/abs/2105.02276
Publikováno v:
New J. Phys. 23 113010 (2021)
We propose VQE circuit fabrics with advantageous properties for the simulation of strongly correlated ground and excited states of molecules and materials under the Jordan-Wigner mapping that can be implemented linearly locally and preserve all relev
Externí odkaz:
http://arxiv.org/abs/2104.05695
Publikováno v:
Phys. Rev. Research 2, 043246 (2020)
We compare the BFGS optimizer, ADAM and Natural Gradient Descent (NatGrad) in the context of Variational Quantum Eigensolvers (VQEs). We systematically analyze their performance on the QAOA ansatz for the Transverse Field Ising Model (TFIM) as well a
Externí odkaz:
http://arxiv.org/abs/2004.14666
Autor:
Bergholm, Ville, Izaac, Josh, Schuld, Maria, Gogolin, Christian, Ahmed, Shahnawaz, Ajith, Vishnu, Alam, M. Sohaib, Alonso-Linaje, Guillermo, AkashNarayanan, B., Asadi, Ali, Arrazola, Juan Miguel, Azad, Utkarsh, Banning, Sam, Blank, Carsten, Bromley, Thomas R, Cordier, Benjamin A., Ceroni, Jack, Delgado, Alain, Di Matteo, Olivia, Dusko, Amintor, Garg, Tanya, Guala, Diego, Hayes, Anthony, Hill, Ryan, Ijaz, Aroosa, Isacsson, Theodor, Ittah, David, Jahangiri, Soran, Jain, Prateek, Jiang, Edward, Khandelwal, Ankit, Kottmann, Korbinian, Lang, Robert A., Lee, Christina, Loke, Thomas, Lowe, Angus, McKiernan, Keri, Meyer, Johannes Jakob, Montañez-Barrera, J. A., Moyard, Romain, Niu, Zeyue, O'Riordan, Lee James, Oud, Steven, Panigrahi, Ashish, Park, Chae-Yeun, Polatajko, Daniel, Quesada, Nicolás, Roberts, Chase, Sá, Nahum, Schoch, Isidor, Shi, Borun, Shu, Shuli, Sim, Sukin, Singh, Arshpreet, Strandberg, Ingrid, Soni, Jay, Száva, Antal, Thabet, Slimane, Vargas-Hernández, Rodrigo A., Vincent, Trevor, Vitucci, Nicola, Weber, Maurice, Wierichs, David, Wiersema, Roeland, Willmann, Moritz, Wong, Vincent, Zhang, Shaoming, Killoran, Nathan
PennyLane is a Python 3 software framework for differentiable programming of quantum computers. The library provides a unified architecture for near-term quantum computing devices, supporting both qubit and continuous-variable paradigms. PennyLane's
Externí odkaz:
http://arxiv.org/abs/1811.04968
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.
Variational quantum algorithms use non-convex optimization methods to find the optimal parameters for a parametrized quantum circuit in order to solve a computational problem. The choice of the circuit ansatz, which consists of parameterized gates, i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::94fe7088b64c51ec7b587d1d065408f8
http://arxiv.org/abs/2303.11355
http://arxiv.org/abs/2303.11355