default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDave Touchette
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j7]Anurag Anshu
, Shima Bab Hadiashar, Rahul Jain, Ashwin Nayak, Dave Touchette:
One-Shot Quantum State Redistribution and Quantum Markov Chains. IEEE Trans. Inf. Theory 69(9): 5788-5804 (2023)- 2022
- [j6]Anurag Anshu, Debbie W. Leung, Dave Touchette:
Incompressibility of Classical Distributions. IEEE Trans. Inf. Theory 68(3): 1758-1771 (2022) - 2021
- [j5]Debbie W. Leung, Ashwin Nayak, Ala Shayeghi, Dave Touchette, Penghui Yao, Nengkun Yu:
Capacity Approaching Coding for Low Noise Interactive Quantum Communication Part I: Large Alphabets. IEEE Trans. Inf. Theory 67(8): 5443-5490 (2021) - [c9]Anurag Anshu, Shima Bab Hadiashar, Rahul Jain, Ashwin Nayak, Dave Touchette:
One-Shot Quantum State Redistribution and Quantum Markov Chains. ISIT 2021: 130-135 - [i17]Anurag Anshu, Shima Bab Hadiashar, Rahul Jain, Ashwin Nayak, Dave Touchette:
One-shot quantum state redistribution and quantum Markov chains. CoRR abs/2104.08753 (2021) - 2020
- [j4]Norbert Lütkenhaus, Ashutosh Marwah, Dave Touchette:
Erasable Bit Commitment From Temporary Quantum Trust. IEEE J. Sel. Areas Inf. Theory 1(2): 536-554 (2020) - [i16]Debbie W. Leung, Ashwin Nayak, Ala Shayeghi, Dave Touchette, Penghui Yao, Nengkun Yu:
Capacity Approaching Coding for Low Noise Interactive Quantum Communication, Part I: Large Alphabets. CoRR abs/2001.02818 (2020)
2010 – 2019
- 2019
- [j3]Gilles Brassard, Ashwin Nayak, Alain Tapp, Dave Touchette, Falk Unger:
Noisy Interactive Quantum Communication. SIAM J. Comput. 48(4): 1147-1195 (2019) - [c8]Anurag Anshu, Naresh Goud Boddu, Dave Touchette:
Quantum Log-Approximate-Rank Conjecture is Also False. FOCS 2019: 982-994 - [i15]Janet Leahy, Dave Touchette, Penghui Yao:
Quantum Insertion-Deletion Channels. CoRR abs/1901.00984 (2019) - [i14]Anurag Anshu, Debbie W. Leung, Dave Touchette:
Incompressibility of classical distributions. CoRR abs/1911.09126 (2019) - 2018
- [j2]Mark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette:
Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness. SIAM J. Comput. 47(6): 2277-2314 (2018) - [c7]Debbie W. Leung, Ashwin Nayak, Ala Shayeghi, Dave Touchette, Penghui Yao, Nengkun Yu:
Capacity approaching coding for low noise interactive quantum communication. STOC 2018: 339-352 - [i13]Dave Touchette, Benjamin Lovitz, Norbert Lütkenhaus:
Practical Quantum Appointment Scheduling. CoRR abs/1801.02771 (2018) - [i12]Anurag Anshu, Naresh Goud Boddu, Dave Touchette:
Quantum Log-Approximate-Rank Conjecture is also False. CoRR abs/1811.10525 (2018) - [i11]Anurag Anshu, Naresh Goud Boddu, Dave Touchette:
Quantum Log-Approximate-Rank Conjecture is also False. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c6]Ashwin Nayak, Dave Touchette:
Augmented Index and Quantum Streaming Algorithms for DYCK(2). CCC 2017: 23:1-23:21 - [c5]Mathieu Laurière, Dave Touchette:
The Flow of Information in Interactive Quantum Protocols: the Cost of Forgetting. ITCS 2017: 47:1-47:1 - [c4]Anurag Anshu, Dave Touchette, Penghui Yao, Nengkun Yu:
Exponential separation of quantum communication and classical information. STOC 2017: 277-288 - [i10]Mathieu Laurière, Dave Touchette:
The Flow of Information in Interactive Quantum Protocols: the Cost of Forgetting. CoRR abs/1701.02062 (2017) - 2016
- [j1]Mario Berta, Matthias Christandl, Dave Touchette:
Smooth Entropy Bounds on One-Shot Quantum State Redistribution. IEEE Trans. Inf. Theory 62(3): 1425-1439 (2016) - [i9]Juan Miguel Arrazola, Dave Touchette:
Quantum Advantage on Information Leakage for Equality. CoRR abs/1607.07516 (2016) - [i8]Ashwin Nayak, Dave Touchette:
Augmented Index and Quantum Streaming Algorithms for DYCK(2). CoRR abs/1610.04937 (2016) - [i7]Anurag Anshu, Dave Touchette, Penghui Yao, Nengkun Yu:
Exponential Separation of Quantum Communication and Classical Information. CoRR abs/1611.08946 (2016) - 2015
- [c3]Mark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette:
Near-Optimal Bounds on Bounded-Round Quantum Communication Complexity of Disjointness. FOCS 2015: 773-791 - [c2]Dave Touchette:
Quantum Information Complexity. STOC 2015: 317-326 - [i6]Mark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette:
Near-optimal bounds on bounded-round quantum communication complexity of disjointness. CoRR abs/1505.03110 (2015) - [i5]Mark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette:
Near-optimal bounds on bounded-round quantum communication complexity of disjointness. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [c1]Gilles Brassard, Ashwin Nayak, Alain Tapp, Dave Touchette, Falk Unger:
Noisy Interactive Quantum Communication. FOCS 2014: 296-305 - [i4]Dave Touchette:
Quantum Information Complexity and Amortized Communication. CoRR abs/1404.3733 (2014) - [i3]Mario Berta, Matthias Christandl, Dave Touchette:
Smooth Entropy Bounds on One-Shot Quantum State Redistribution. CoRR abs/1409.4338 (2014) - 2013
- [i2]Gilles Brassard, Alain Tapp, Dave Touchette:
Noisy Interactive Quantum Communication. CoRR abs/1309.2643 (2013) - 2010
- [i1]Kamil Brádler, Patrick M. Hayden, Dave Touchette, Mark M. Wilde:
Trade-off capacities of the quantum Hadamard channels. CoRR abs/1001.1732 (2010)
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-08-05 20:13 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:
