default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn A. Smolin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c10]Vikesh Siddhu, Dina Abdelhadi, Tomas Jochym-O'Connor, John A. Smolin:
Entanglement Sharing Across a Damping-Dephasing Channel. ISIT 2024: 1432-1437- [i10]Vikesh Siddhu, Dina Abdelhadi, Tomas Jochym-O'Connor, John A. Smolin:
Entanglement sharing across a damping-dephasing channel. CoRR abs/2405.06231 (2024) - 2023
- [j12]Felix Leditzky
, Debbie W. Leung, Vikesh Siddhu, Graeme Smith, John A. Smolin:
The Platypus of the Quantum Channel Zoo. IEEE Trans. Inf. Theory 69(6): 3825-3849 (2023) - 2022
- [c9]Felix Leditzky, Debbie W. Leung, Vikesh Siddhu, Graeme Smith, John A. Smolin:
The platypus of the quantum channel zoo. ISIT 2022: 2433-2438 - [i9]Felix Leditzky, Debbie W. Leung, Vikesh Siddhu, Graeme Smith, John A. Smolin:
Generic nonadditivity of quantum capacity in simple channels. CoRR abs/2202.08377 (2022) - [i8]Felix Leditzky, Debbie W. Leung, Vikesh Siddhu, Graeme Smith, John A. Smolin:
The platypus of the quantum channel zoo. CoRR abs/2202.08380 (2022) - 2021
- [c8]Yihui Quek, Srinivasan Arunachalam, John A. Smolin:
Private learning implies quantum stability. NeurIPS 2021: 20503-20515 - [i7]Srinivasan Arunachalam, Yihui Quek, John A. Smolin:
Private learning implies quantum stability. CoRR abs/2102.07171 (2021) - 2020
- [i6]Tom Achache, Lior Horesh, John A. Smolin:
Denoising quantum states with Quantum Autoencoders - Theory and Applications. CoRR abs/2012.14714 (2020)
2010 – 2019
- 2019
- [c7]David Gosset, John A. Smolin:
A Compressed Classical Description of Quantum States. TQC 2019: 8:1-8:9 - 2018
- [i5]David Gosset, John A. Smolin:
A compressed classical description of quantum states. CoRR abs/1801.05721 (2018) - 2015
- [j11]Markus Grassl, Peter W. Shor, Graeme Smith, John A. Smolin, Bei Zeng:
New Constructions of Codes for Asymmetric Channels via Concatenation. IEEE Trans. Inf. Theory 61(4): 1879-1886 (2015) - 2013
- [j10]John A. Smolin, Graeme Smith, Alexander Vargo:
Oversimplifying quantum factoring. Nat. 499(7457): 163-165 (2013) - [i4]Maris Ozols, Graeme Smith, John A. Smolin:
Bound entangled states with secret key and their classical counterpart. CoRR abs/1305.0848 (2013) - [i3]Markus Grassl, Peter W. Shor, Graeme Smith, John A. Smolin, Bei Zeng:
New Constructions of Codes for Asymmetric Channels via Concatenation. CoRR abs/1310.7536 (2013) - 2012
- [c6]Markus Grassl, Peter W. Shor, Graeme Smith, John A. Smolin, Bei Zeng:
New constructions of codes for asymmetric channels via concatenation. ISIT 2012: 751-755 - 2011
- [j9]Peter W. Shor, Graeme Smith, John A. Smolin, Bei Zeng:
High Performance Single-Error-Correcting Quantum Codes for Amplitude Damping. IEEE Trans. Inf. Theory 57(10): 7180-7188 (2011) - [i2]Graeme Smith, John A. Smolin, Jon Yard:
Gaussian bosonic synergy: quantum communication via realistic channels of zero quantum capacity. CoRR abs/1102.4580 (2011)
2000 – 2009
- 2009
- [j8]Andrew W. Cross, Graeme Smith, John A. Smolin, Bei Zeng:
Codeword Stabilized Quantum Codes. IEEE Trans. Inf. Theory 55(1): 433-438 (2009) - 2008
- [j7]Graeme Smith, John A. Smolin, Andreas J. Winter:
The Quantum Capacity With Symmetric Side Channels. IEEE Trans. Inf. Theory 54(9): 4208-4217 (2008) - [c5]Andrew W. Cross, Graeme Smith, John A. Smolin, Bei Zeng:
Codeword stabilized quantum codes. ISIT 2008: 364-368 - [c4]Graeme Smith, John A. Smolin:
Degenerate quantum codes and the quantum channel capacity problem. ITW 2008: 358-359 - [c3]Graeme Smith, John A. Smolin:
Additive extensions of a quantum channel. ITW 2008: 368-372 - 2005
- [j6]John A. Smolin:
Can quantum cryptography imply quantum mechanics? Quantum Inf. Comput. 5(2): 161-169 (2005) - 2004
- [j5]John A. Smolin:
The early days of experimental quantum cryptography. IBM J. Res. Dev. 48(1): 47-52 (2004) - 2003
- [j4]Pawel Horodecki, John A. Smolin, Barbara M. Terhal, Ashish V. Thapliyal:
Rank two bipartite bound entangled states do not exist. Theor. Comput. Sci. 292(3): 589-596 (2003) - [j3]Charles H. Bennett, Aram W. Harrow, Debbie W. Leung, John A. Smolin:
On the capacities of bipartite Hamiltonians and unitary gates. IEEE Trans. Inf. Theory 49(8): 1895-1911 (2003) - 2002
- [j2]Charles H. Bennett, Peter W. Shor, John A. Smolin, Ashish V. Thapliyal:
Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem. IEEE Trans. Inf. Theory 48(10): 2637-2655 (2002) - [i1]Charles H. Bennett, John A. Smolin:
Trust enhancement by multiple random beacons. CoRR cs.CR/0201003 (2002)
1990 – 1999
- 1998
- [c2]David P. DiVincenzo, Christopher A. Fuchs, Hideo Mabuchi, John A. Smolin, Ashish V. Thapliyal, Armin Uhlmann:
Entanglement of Assistance. QCQC 1998: 247-257 - 1992
- [j1]Charles H. Bennett, François Bessette, Gilles Brassard, Louis Salvail, John A. Smolin:
Experimental Quantum Cryptography. J. Cryptol. 5(1): 3-28 (1992) - 1990
- [c1]Charles H. Bennett, François Bessette, Gilles Brassard, Louis Salvail, John A. Smolin:
Experimental Quantum Cryptography. EUROCRYPT 1990: 253-265
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-12 23:02 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:
