default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Gross 0003
Person information
- affiliation: University of Cologne, Institute for Theoretical Physics, Germany
- affiliation (2011 - 2015): University of Freiburg, Institute for Physics, Germany
- affiliation (2010 - 2011): ETH Zürich, Institute for Theoretical Physics, Switzerland
- affiliation (2008 - 2010): Technical University Braunschweig, Institute for Mathematical Physics, Germany
- affiliation (2008 - 2010): Leibniz University Hannover, Institute for Theoretical Physics, Germany
- affiliation (PhD 2008): Imperial College London, Institute for Mathematical Sciences, UK
Other persons with the same name
- David Gross — disambiguation page
- David Gross-Amblard (aka: David Gross 0001) — Rennes University, France (and 1 more)
- David Gross 0002 — Digital Equipment Corp., Hudson, MA, USA
- David Gross 0004
![[0000-0002-9503-8524]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-9503-8524")
— Robert Bosch GmbH, Schwieberdingen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j9]Tim Fuchs, David Gross, Felix Krahmer, Richard Kueng, Dustin G. Mixon:
Sketching with Kerdock's Crayons: Fast Sparsifying Transforms for Arbitrary Linear Maps. SIAM J. Matrix Anal. Appl. 43(2): 939-952 (2022)- 2021
- [i14]Tim Fuchs, David Gross, Felix Krahmer, Richard Kueng, Dustin G. Mixon:
Sketching with Kerdock's crayons: Fast sparsifying transforms for arbitrary linear maps. CoRR abs/2105.05879 (2021) - [i13]Tim Fuchs, David Gross, Peter Jung, Felix Krahmer, Richard Kueng, Dominik Stöger:
Proof methods for robust low-rank matrix recovery. CoRR abs/2106.04382 (2021) - 2020
- [j8]Aditya Kela, Kai Von Prillwitz, Johan Åberg, Rafael Chaves, David Gross:
Semidefinite Tests for Latent Causal Structures. IEEE Trans. Inf. Theory 66(1): 339-349 (2020)
2010 – 2019
- 2018
- [j7]Ulrich Michel, Martin Kliesch, Richard Kueng, David Gross:
Comments on "Improving Compressed Sensing With the Diamond Norm"-Saturation of the Norm Inequalities Between Diamond and Nuclear Norm. IEEE Trans. Inf. Theory 64(11): 7443-7445 (2018) - [i12]Ingo Roth, Richard Kueng, Shelby Kimmel, Yi-Kai Liu, David Gross, Jens Eisert, Martin Kliesch:
Recovering quantum gates from few average gate fidelities. CoRR abs/1803.00572 (2018) - 2017
- [i11]Martin Kliesch, Richard Kueng, Jens Eisert, David Gross:
Guaranteed recovery of quantum processes from few measurements. CoRR abs/1701.03135 (2017) - 2016
- [j6]Martin Kliesch, Richard Kueng, Jens Eisert, David Gross:
Improving Compressed Sensing With the Diamond Norm. IEEE Trans. Inf. Theory 62(12): 7445-7463 (2016) - [i10]Richard Kueng, Huangjun Zhu, David Gross:
Low rank matrix recovery from Clifford orbits. CoRR abs/1610.08070 (2016) - [i9]Ulrich Michel, Martin Kliesch, Richard Kueng, David Gross:
Note on the saturation of the norm inequalities between diamond and nuclear norm. CoRR abs/1612.07931 (2016) - 2015
- [i8]Richard Kueng, David Gross:
Qubit stabilizer states are complex projective 3-designs. CoRR abs/1510.02767 (2015) - [i7]Martin Kliesch, Richard Kueng, Jens Eisert, David Gross:
Improving compressed sensing with the diamond norm. CoRR abs/1511.01513 (2015) - 2014
- [c1]Rafael Chaves, Lukas Luft, Thiago O. Maciel, David Gross, Dominik Janzing, Bernhard Schölkopf:
Inferring latent structures via information inequalities. UAI 2014: 112-121 - [i6]David Gross, Felix Krahmer, Richard Kueng:
Improved Recovery Guarantees for Phase Retrieval from Coded Diffraction Patterns. CoRR abs/1402.6286 (2014) - 2013
- [i5]David Gross, Michael Walter:
Stabilizer information inequalities from phase space distributions. CoRR abs/1302.6990 (2013) - [i4]David Gross, Felix Krahmer, Richard Kueng:
A Partial Derandomization of PhaseLift using Spherical Designs. CoRR abs/1310.2267 (2013) - 2012
- [j5]David Marcus Appleby, Ingemar Bengtsson, Stephen Brierley, Markus Grassl, David Gross, Jan-Åke Larsson:
The monomial representations of the Clifford group. Quantum Inf. Comput. 12(5-6): 404-431 (2012) - [i3]Richard Kueng, David Gross:
RIPless compressed sensing from anisotropic measurements. CoRR abs/1205.1423 (2012) - 2011
- [j4]David Gross:
Recovering Low-Rank Matrices From Few Coefficients in Any Basis. IEEE Trans. Inf. Theory 57(3): 1548-1566 (2011) - 2010
- [i2]David Gross, Vincent Nesme:
Note on sampling without replacing from a finite collection of matrices. CoRR abs/1001.2738 (2010)
2000 – 2009
- 2009
- [i1]David Gross:
Recovering low-rank matrices from few coefficients in any basis. CoRR abs/0910.1879 (2009) - 2008
- [b1]David Gross:
Computational power of quantum many-body states and some results on discrete phase spaces. Imperial College London, UK, 2008 - [j3]David Gross, Maarten Van den Nest:
The LU-LC conjecture, diagonal local operations and quadratic forms over GF(2). Quantum Inf. Comput. 8(3): 263-281 (2008) - [j2]David Gross, Jens Eisert:
Quantum margulis expanders. Quantum Inf. Comput. 8(8): 722-733 (2008) - [j1]Gary McConnell, David Gross:
Efficient 2-designs from bases exist. Quantum Inf. Comput. 8(8): 734-740 (2008)
Coauthor Index
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-10-07 22:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
