Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Update some links #29

Merged
merged 1 commit into from
Dec 15, 2023
Merged

Update some links #29

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion PackageInfo.g
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -141,7 +141,7 @@ SetPackageInfo(
&copyright; 2021 by Leonid P. Pryadko and Vadim A. Shabashov<P/>
&QDistRnd; package is free software;
you can redistribute it and/or modify it under the terms of the
<URL Text="GNU General Public License">http://www.fsf.org/licenses/gpl.html</URL>
<URL Text="GNU General Public License">https://www.fsf.org/licenses/gpl.html</URL>
as published by the Free Software Foundation; either version 2 of the License,
or (at your option) any later version.
""",
Expand Down
10 changes: 5 additions & 5 deletions doc/QDistRnd.bib
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -22,7 +22,7 @@ @Article{Calderbank-1997
presented, as well as a table of upper and lower
bounds on such codes of length up to 30 qubits},
doi = {10.1109/18.681315},
url = {http://dx.doi.org/10.1109/18.681315},
url = {https://doi.org/10.1109/18.681315},
}

@PhdThesis{gottesman-thesis,
Expand All @@ -46,7 +46,7 @@ @PhdThesis{gottesman-thesis
of known codes, the capacity of a quantum channel,
bounds on quantum codes, and fault-tolerant quantum
computation.},
url = "http://arxiv.org/abs/quant-ph/9705052"
url = "https://arxiv.org/abs/quant-ph/9705052"
}

@ARTICLE{Ashikhmin-Knill-2001,
Expand Down Expand Up @@ -334,7 +334,7 @@ @article{Dumer-Kovalev-Pryadko-bnd-2015
publisher = {American Physical Society},
doi = {10.1103/PhysRevLett.115.050502},
url =
{http://link.aps.org/doi/10.1103/PhysRevLett.115.050502},
{https://doi.org/10.1103/PhysRevLett.115.050502},
eprint = {1412.6172},
annote = {We suggest a technique for constructing lower
(existence) bounds for the fault-tolerant threshold
Expand Down Expand Up @@ -446,7 +446,7 @@ @book{Cramer-book-1999
publisher = {Princeton University Press},
year = 1999,
ISBN = 9780691005478,
URL = {http://www.jstor.org/stable/j.ctt1bpm9r4},
URL = {https://www.jstor.org/stable/j.ctt1bpm9r4},
abstract = {In this classic of statistical mathematical theory,
Harald Cramér joins the two major lines of
development in the field: while British and American
Expand All @@ -473,7 +473,7 @@ @misc{ConwayPol-2022
author = {Frank L{\"u}beck},
title = {Conway polynomials for finite fields},
url =
{http://www.math.rwth-aachen.de/~Frank.Luebeck/data/ConwayPol/},
{https://www.math.rwth-aachen.de/~Frank.Luebeck/data/ConwayPol/},
note = {[Downloaded on 2022-02-19]},
year = 2021,
annote = {Extensive list of Conway polynomials used to define
Expand Down
13 changes: 6 additions & 7 deletions joss/QDistRnd.bib
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -78,7 +78,7 @@ @article{Kovalev-Pryadko-Hyperbicycle-2013
parameters; in particular, they can have a higher
rate while preserving the estimated error threshold.},
doi = {10.1103/PhysRevA.88.012311},
url = {http://link.aps.org/doi/10.1103/PhysRevA.88.012311},
url = {https://doi.org/10.1103/PhysRevA.88.012311},
}

@InProceedings{Bravyi-Hastings-2013,
Expand Down Expand Up @@ -141,8 +141,7 @@ @article{Guth-Lubotzky-2014
who asked whether homological codes with such
parameters could exist at all.},
doi = {10.1063/1.4891487},
url = {http://scitation.aip.org/content/aip/journal/jmp/55/8/
10.1063/1.4891487},
url = {https://doi.org/10.1063/1.4891487},
}

@article{Panteleev-Kalachev-2019,
Expand Down Expand Up @@ -194,7 +193,7 @@ @article{Evseev-1983
title = {Complexity of decoding for linear codes.},
volume = {19},
year = {1983},
annote = {http://www.ams.org/mathscinet-getitem?mr=734143 The
annote = {https://www.ams.org/mathscinet-getitem?mr=734143 The
author introduces the notion of $Q$ decoding of
linear codes. To each code is associated a $Q$
ensemble which is the product space of the Euclidean
Expand Down Expand Up @@ -259,7 +258,7 @@ @article{magma-system
annote = {recommended citation for Magma},
doi = {10.1006/jsco.1996.0125},
issn = {0747-7171},
url = {http://dx.doi.org/10.1006/jsco.1996.0125},
url = {https://doi.org/10.1006/jsco.1996.0125},
}

@article{Kovalev-Pryadko-FT-2013,
Expand Down Expand Up @@ -288,7 +287,7 @@ @article{Kovalev-Pryadko-FT-2013
sufficiently large quantum computers, offer an
advantage over the toric codes.},
doi = {10.1103/PhysRevA.87.020304},
url = {http://link.aps.org/doi/10.1103/PhysRevA.87.020304},
url = {https://doi.org/10.1103/PhysRevA.87.020304},
}

@phdthesis{Breuckmann-thesis-2017,
Expand Down Expand Up @@ -610,7 +609,7 @@ @Unpublished{Panteleev-Kalachev-2021
title = {Asymptotically Good Quantum and Locally Testable
Classical LDPC Codes},
note = {Unpublished},
url = {http://arxiv.org/abs/2111.03654},
url = {https://arxiv.org/abs/2111.03654},
year = 2021,
annote = {We study classical and quantum LDPC codes of
constant rate obtained by the lifted product
Expand Down