![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Lucas Friedrich
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j5]Lucas Friedrich, Jonas Maziero
:
Restricting to the chip architecture maintains the quantum neural network accuracy. Quantum Inf. Process. 23(4): 131 (2024) - [i7]Lucas Friedrich, Jonas Maziero:
Quantum neural network with ensemble learning to mitigate barren plateaus and cost function concentration. CoRR abs/2402.06026 (2024) - [i6]Lucas Friedrich, Tiago de Souza Farias, Jonas Maziero:
Barren plateaus induced by the dimension of qudits. CoRR abs/2405.08190 (2024) - 2023
- [j4]Lucas Friedrich, Jonas Maziero
:
Evolution strategies: application in hybrid quantum-classical neural networks. Quantum Inf. Process. 22(3): 132 (2023) - [i5]Lucas Friedrich, Jonas Maziero:
The quantum cost function concentration dependency on the parametrization expressivity. CoRR abs/2301.06883 (2023) - 2022
- [i4]Lucas Friedrich, Jonas Maziero:
Natural evolutionary strategies applied to quantum-classical hybrid neural networks. CoRR abs/2205.08059 (2022) - [i3]Lucas Friedrich, Jonas Maziero:
Avoiding Barren Plateaus with Classical Deep Neural Networks. CoRR abs/2205.13418 (2022) - [i2]Lucas Friedrich, Jonas Maziero:
Restricting to the chip architecture maintains the quantum neural network accuracy, if the parameterization is a 2-design. CoRR abs/2212.14426 (2022)
2010 – 2019
- 2019
- [j3]Lucas Friedrich, Gero Schnücke, Andrew R. Winters
, David C. Del Rey Fernández
, Gregor J. Gassner
, Mark H. Carpenter:
Entropy Stable Space-Time Discontinuous Galerkin Schemes with Summation-by-Parts Property for Hyperbolic Conservation Laws. J. Sci. Comput. 80(1): 175-222 (2019) - [i1]David C. Del Rey Fernández, Mark H. Carpenter, Lisandro Dalcín, Lucas Friedrich, Andrew R. Winters, Gregor J. Gassner, Matteo Parsani
:
Entropy Stable p-Nonconforming Discretizations with the Summation-by-Parts Property for the Compressible Navier-Stokes Equations. CoRR abs/1909.12546 (2019) - 2018
- [j2]Lucas Friedrich, David C. Del Rey Fernández
, Andrew R. Winters, Gregor J. Gassner
, David W. Zingg, Jason E. Hicken:
Conservative and Stable Degree Preserving SBP Operators for Non-conforming Meshes. J. Sci. Comput. 75(2): 657-686 (2018) - [j1]Lucas Friedrich, Andrew R. Winters
, David C. Del Rey Fernández
, Gregor J. Gassner
, Matteo Parsani
, Mark H. Carpenter:
An Entropy Stable h / p Non-Conforming Discontinuous Galerkin Method with the Summation-by-Parts Property. J. Sci. Comput. 77(2): 689-725 (2018)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-25 21:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint