default search action
Matthias Christandl
Person information
- affiliation: University of Copenhagen, Department of Mathematical Sciences, Denmark
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j19]Matthias Christandl
, Fulvio Gesmundo
Partial Degeneration of Tensors. SIAM J. Matrix Anal. Appl. 45(1): 771-800 (2024) - [j18]Matthias Christandl
Fault-Tolerant Coding for Quantum Communication. IEEE Trans. Inf. Theory 70(1): 282-317 (2024) - [j17]Paula Belzig
Fault-Tolerant Coding for Entanglement-Assisted Communication. IEEE Trans. Inf. Theory 70(4): 2655-2673 (2024) - [c18]Jop Briët, Matthias Christandl, Itai Leigh, Amir Shpilka, Jeroen Zuiddam:
Discreteness of Asymptotic Tensor Ranks (Extended Abstract). ITCS 2024: 20:1-20:14 - 2023
- [j16]Matthias Christandl
A Gap in the Subrank of Tensors. SIAM J. Appl. Algebra Geom. 7(4): 742-767 (2023) - [c17]Paula Belzig, Matthias Christandl, Alexander Müller-Hermes:
Fault-Tolerant Coding for Entanglement-Assisted Communication. ISIT 2023: 84-89 - [c16]Matthias Christandl, Mads Friis Frand-Madsen
On the Relation between Quantum Data Hiding and Quantum Key Distribution. ISIT 2023: 985-990 - [i28]Jop Briët, Matthias Christandl, Itai Leigh, Amir Shpilka
Discreteness of asymptotic tensor ranks. CoRR abs/2306.01718 (2023) - [i27]Matthias Christandl:
The Tensor as an Informational Resource. CoRR abs/2311.02190 (2023) - 2022
- [j15]Matthias Christandl, Nicholas Gauguin Houghton-Larsen, Laura Mancinska
An Operational Environment for Quantum Self-Testing. Quantum 6: 699 (2022) - [c15]Matthias Christandl, Omar Fawzi
Larger Corner-Free Sets from Combinatorial Degenerations. ITCS 2022: 48:1-48:20 - [i26]Paula Belzig, Matthias Christandl, Alexander Müller-Hermes:
Fault-tolerant Coding for Entanglement-Assisted Communication. CoRR abs/2210.02939 (2022) - [i25]Matthias Christandl, Fulvio Gesmundo, Jeroen Zuiddam:
A Gap in the Subrank of Tensors. CoRR abs/2212.01668 (2022) - [i24]Matthias Christandl, Fulvio Gesmundo, Vladimir Lysikov
Partial Degeneration of Tensors. CoRR abs/2212.14095 (2022) - 2021
- [j14]Harry Buhrman, Matthias Christandl, Michal Koucký
High Entropy Random Selection Protocols. Algorithmica 83(2): 667-694 (2021) - [j13]Matthias Christandl
Border Rank Nonadditivity for Higher Order Tensors. SIAM J. Matrix Anal. Appl. 42(2): 503-527 (2021) - [j12]Matthias Christandl, Péter Vrana, Jeroen Zuiddam:
Barriers for Fast Matrix Multiplication from Irreversibility. Theory Comput. 17: 1-32 (2021) - [i23]Matthias Christandl, Omar Fawzi, Hoang Ta, Jeroen Zuiddam:
Communication Complexity, Corner-Free Sets and the Symmetric Subrank of Tensors. CoRR abs/2104.01130 (2021) - [i22]Andreas Bluhm, Matthias Christandl, Florian Speelman:
Position-based cryptography: Single-qubit protocol secure against multi-qubit attacks. CoRR abs/2104.06301 (2021) - [i21]Matthias Christandl, Omar Fawzi, Hoang Ta, Jeroen Zuiddam:
Larger Corner-Free Sets from Combinatorial Degenerations. CoRR abs/2111.08262 (2021) - 2020
- [j11]Matthias Christandl
Random Private Quantum States. IEEE Trans. Inf. Theory 66(7): 4621-4640 (2020) - [i20]Matthias Christandl, François Le Gall, Vladimir Lysikov
Barriers for rectangular matrix multiplication. CoRR abs/2003.03019 (2020) - [i19]Matthias Christandl, Fulvio Gesmundo, Mateusz Michalek, Jeroen Zuiddam:
Border rank non-additivity for higher order tensors. CoRR abs/2007.05458 (2020) - [i18]Matthias Christandl, Alexander Müller-Hermes:
Fault-tolerant Coding for Quantum Communication. CoRR abs/2009.07161 (2020) - [i17]Matthias Christandl, Vladimir Lysikov
Weighted Slice Rank and a Minimax Correspondence to Strassen's Spectra. CoRR abs/2012.14412 (2020) - [i16]Matthias Christandl, François Le Gall, Vladimir Lysikov, Jeroen Zuiddam:
Barriers for Rectangular Matrix Multiplication. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j10]Matthias Christandl, Jeroen Zuiddam:
Tensor surgery and tensor rank. Comput. Complex. 28(1): 27-56 (2019) - [j9]Matthias Christandl, Péter Vrana
Asymptotic tensor rank of graph tensors: beyond matrix multiplication. Comput. Complex. 28(1): 57-111 (2019) - [j8]Matthias Christandl
Border Rank Is Not Multiplicative under the Tensor Product. SIAM J. Appl. Algebra Geom. 3(2): 231-255 (2019) - [j7]Péter Vrana
Distillation of Greenberger-Horne-Zeilinger States by Combinatorial Methods. IEEE Trans. Inf. Theory 65(9): 5945-5958 (2019) - [c14]Matthias Christandl
Barriers for Fast Matrix Multiplication from Irreversibility. CCC 2019: 26:1-26:17 - 2018
- [j6]Markus Bläser, Matthias Christandl, Jeroen Zuiddam:
The border support rank of two-by-two matrix multiplication is seven. Chic. J. Theor. Comput. Sci. 2018 (2018) - [c13]Matthias Christandl, Roberto Ferrara
Random Private Quantum States. ISIT 2018: 1784-1788 - [c12]Matthias Christandl, Péter Vrana
Universal points in the asymptotic spectrum of tensors. STOC 2018: 289-296 - [i15]Matthias Christandl, Péter Vrana, Jeroen Zuiddam:
Barriers for fast matrix multiplication from irreversibility. CoRR abs/1812.06952 (2018) - 2017
- [j5]Peter Bürgisser, Matthias Christandl, Ketan D. Mulmuley, Michael Walter
Membership in Moment Polytopes is in NP and coNP. SIAM J. Comput. 46(3): 972-991 (2017) - [c11]Harry Buhrman, Matthias Christandl, Jeroen Zuiddam:
Nondeterministic Quantum Communication Complexity: the Cyclic Equality Game and Iterated Matrix Multiplication. ITCS 2017: 24:1-24:18 - [i14]Matthias Christandl, Asger Kjærulff Jensen, Jeroen Zuiddam:
Tensor rank is not multiplicative under the tensor product. CoRR abs/1705.09379 (2017) - [i13]Markus Bläser, Matthias Christandl, Jeroen Zuiddam:
The border support rank of two-by-two matrix multiplication is seven. CoRR abs/1705.09652 (2017) - [i12]Matthias Christandl, Péter Vrana, Jeroen Zuiddam:
Universal points in the asymptotic spectrum of tensors. CoRR abs/1709.07851 (2017) - 2016
- [j4]Mario Berta
Smooth Entropy Bounds on One-Shot Quantum State Redistribution. IEEE Trans. Inf. Theory 62(3): 1425-1439 (2016) - [i11]Harry Buhrman, Matthias Christandl, Jeroen Zuiddam:
Nondeterministic quantum communication complexity: the cyclic equality game and iterated matrix multiplication. CoRR abs/1603.03757 (2016) - [i10]Péter Vrana, Matthias Christandl:
Entanglement distillation from Greenberger-Horne-Zeilinger shares. CoRR abs/1603.03964 (2016) - [i9]Matthias Christandl, Jeroen Zuiddam:
Tensor surgery and tensor rank. CoRR abs/1606.04085 (2016) - [i8]Matthias Christandl, Péter Vrana, Jeroen Zuiddam:
Asymptotic tensor rank of graph tensors: beyond matrix multiplication. CoRR abs/1609.07476 (2016) - 2015
- [i7]Peter Bürgisser, Matthias Christandl, Ketan D. Mulmuley, Michael Walter:
Membership in moment polytopes is in NP and coNP. CoRR abs/1511.03675 (2015) - 2014
- [j3]Lluis Masanes
Full Security of Quantum Key Distribution From No-Signaling Constraints. IEEE Trans. Inf. Theory 60(8): 4973-4986 (2014) - [i6]Stefan Bäuml, Matthias Christandl, Karol Horodecki, Andreas J. Winter:
Limitations on Quantum Key Repeaters. CoRR abs/1402.5927 (2014) - [i5]Mario Berta, Matthias Christandl, Dave Touchette:
Smooth Entropy Bounds on One-Shot Quantum State Redistribution. CoRR abs/1409.4338 (2014) - 2013
- [j2]Mario Berta
Entanglement Cost of Quantum Channels. IEEE Trans. Inf. Theory 59(10): 6779-6795 (2013) - 2012
- [c10]Matthias Christandl, Brent Doran, Michael Walter
Computing Multiplicities of Lie Group Representations. FOCS 2012: 639-648 - [c9]Mario Berta
Entanglement cost of quantum channels. ISIT 2012: 900-904 - [i4]Harry Buhrman, Matthias Christandl, Christian Schaffner:
Complete Insecurity of Quantum Protocols for Classical Two-Party Computation. CoRR abs/1201.0849 (2012) - [i3]Matthias Christandl, Brent Doran, Michael Walter:
Computing Multiplicities of Lie Group Representations. CoRR abs/1204.4379 (2012) - 2011
- [c8]Fernando G. S. L. Brandão, Matthias Christandl, Jon Yard
A quasipolynomial-time algorithm for the quantum separability problem. STOC 2011: 343-352 - 2010
- [c7]Mario Berta
A Conceptually Simple Proof of the Quantum Reverse Shannon Theorem. TQC 2010: 131-140 - [i2]Fernando G. S. L. Brandão, Matthias Christandl, Jon Yard:
A quasipolynomial-time algorithm for the quantum separability problem. CoRR abs/1011.2751 (2010)
2000 – 2009
- 2008
- [c6]Matthias Christandl:
A Quantum Information-Theoretic Proof of the Relation between Horn's Problem and the Littlewood-Richardson Coefficients. CiE 2008: 120-128 - 2007
- [c5]Harry Buhrman, Matthias Christandl, Michal Koucký
High Entropy Random Selection Protocols. APPROX-RANDOM 2007: 366-379 - [c4]Matthias Christandl, Artur Ekert, Michal Horodecki, Pawel Horodecki, Jonathan Oppenheim, Renato Renner:
Unifying Classical and Quantum Key Distillation. TCC 2007: 456-478 - [i1]Nikolai K. Vereshchagin, Harry Buhrman, Matthias Christandl, Michal Koucký, Zvi Lotker, Boaz Patt-Shamir:
High Entropy Random Selection Protocols. Algebraic Methods in Computational Complexity 2007 - 2005
- [j1]Matthias Christandl, Andreas J. Winter
Uncertainty, Monogamy, and Locking of Quantum Correlations. IEEE Trans. Inf. Theory 51(9): 3159-3165 (2005) - [c3]Matthias Christandl, Stephanie Wehner:
Quantum Anonymous Transmissions. ASIACRYPT 2005: 217-235 - [c2]Matthias Christandl, Andreas J. Winter
Uncertainty, monogamy and locking of quantum correlations. ISIT 2005: 879-883 - 2004
- [c1]Matthias Christandl, Renato Renner:
On intrinsic information. ISIT 2004: 135
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:15 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: