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

Creating pull request for 10.21105.joss.01705 #1190

Merged
merged 2 commits into from Dec 19, 2019
Merged

Creating pull request for 10.21105.joss.01705 #1190

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
63ab628
Creating 10.21105.joss.01705.pdf
whedon Dec 19, 2019
d838348
Creating 10.21105.joss.01705.crossref.xml
whedon Dec 19, 2019
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Jump to
Jump to file
Failed to load files.
Diff view
Diff view
169 changes: 169 additions & 0 deletions joss.01705/10.21105.joss.01705.crossref.xml
View file
Open in desktop
@@ -0,0 +1,169 @@
<?xml version="1.0" encoding="UTF-8"?>
<doi_batch xmlns="http://www.crossref.org/schema/4.4.0" xmlns:ai="http://www.crossref.org/AccessIndicators.xsd" xmlns:rel="http://www.crossref.org/relations.xsd" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" version="4.4.0" xsi:schemaLocation="http://www.crossref.org/schema/4.4.0 http://www.crossref.org/schemas/crossref4.4.0.xsd">
<head>
<doi_batch_id>17f0c683ffbe33b8b9248353721adf94</doi_batch_id>
<timestamp>20191219204229</timestamp>
<depositor>
<depositor_name>JOSS Admin</depositor_name>
<email_address>admin@theoj.org</email_address>
</depositor>
<registrant>The Open Journal</registrant>
</head>
<body>
<journal>
<journal_metadata>
<full_title>Journal of Open Source Software</full_title>
<abbrev_title>JOSS</abbrev_title>
<issn media_type="electronic">2475-9066</issn>
<doi_data>
<doi>10.21105/joss</doi>
<resource>https://joss.theoj.org</resource>
</doi_data>
</journal_metadata>
<journal_issue>
<publication_date media_type="online">
<month>12</month>
<year>2019</year>
</publication_date>
<journal_volume>
<volume>4</volume>
</journal_volume>
<issue>44</issue>
</journal_issue>
<journal_article publication_type="full_text">
<titles>
<title>The Walrus: a library for the calculation of hafnians, Hermite polynomials and Gaussian boson sampling</title>
</titles>
<contributors>
<person_name sequence="first" contributor_role="author">
<given_name>Brajesh</given_name>
<surname>Gupt</surname>
<ORCID>http://orcid.org/0000-0002-6352-8342</ORCID>
</person_name>
<person_name sequence="additional" contributor_role="author">
<given_name>Josh</given_name>
<surname>Izaac</surname>
<ORCID>http://orcid.org/0000-0003-2640-0734</ORCID>
</person_name>
<person_name sequence="additional" contributor_role="author">
<given_name>Nicolás</given_name>
<surname>Quesada</surname>
<ORCID>http://orcid.org/0000-0002-0175-1688</ORCID>
</person_name>
</contributors>
<publication_date>
<month>12</month>
<day>19</day>
<year>2019</year>
</publication_date>
<pages>
<first_page>1705</first_page>
</pages>
<publisher_item>
<identifier id_type="doi">10.21105/joss.01705</identifier>
</publisher_item>
<ai:program name="AccessIndicators">
<ai:license_ref applies_to="vor">http://creativecommons.org/licenses/by/4.0/</ai:license_ref>
<ai:license_ref applies_to="am">http://creativecommons.org/licenses/by/4.0/</ai:license_ref>
<ai:license_ref applies_to="tdm">http://creativecommons.org/licenses/by/4.0/</ai:license_ref>
</ai:program>
<rel:program>
<rel:related_item>
<rel:description>Software archive</rel:description>
<rel:inter_work_relation relationship-type="references" identifier-type="doi">“https://doi.org/10.5281/zenodo.3585911”</rel:inter_work_relation>
</rel:related_item>
<rel:related_item>
<rel:description>GitHub review issue</rel:description>
<rel:inter_work_relation relationship-type="hasReview" identifier-type="uri">https://github.com/openjournals/joss-reviews/issues/1705</rel:inter_work_relation>
</rel:related_item>
</rel:program>
<doi_data>
<doi>10.21105/joss.01705</doi>
<resource>https://joss.theoj.org/papers/10.21105/joss.01705</resource>
<collection property="text-mining">
<item>
<resource mime_type="application/pdf">http://www.theoj.org/joss-papers/joss.01705/10.21105.joss.01705.pdf</resource>
</item>
</collection>
</doi_data>
<citation_list>
<citation key="ref1">
<doi>10.1007/BF02781659</doi>
</citation>
<citation key="ref2">
<doi>10.1007/978-3-319-51829-9</doi>
</citation>
<citation key="ref3">
<doi>10.1016/0304-3975(79)90044-6</doi>
</citation>
<citation key="ref4">
<unstructured_citation>Bromley, Thomas R. and Arrazola, Juan Miguel and Jahangiri, Soran and Izaac, Josh and Quesada, Nicolás and Delgado Gran, Alain and Schuld, Maria and Swinarton, Jeremy and Zabaneh, Zeid and Killoran, Nathan, Applications of Near-Term Photonic Quantum Computers: Software and Algorithms, 2019, arXiv preprint arXiv:1912.07634</unstructured_citation>
</citation>
<citation key="ref5">
<doi>10.1017/S0013091500011299</doi>
</citation>
<citation key="ref6">
<doi>10.1137/1.9781611973099.73</doi>
</citation>
<citation key="ref7">
<doi>10.1103/PhysRevA.100.032326</doi>
</citation>
<citation key="ref8">
<doi>10.1063/1.5086387</doi>
</citation>
<citation key="ref9">
<doi>10.1103/PhysRevA.100.022341</doi>
</citation>
<citation key="ref10">
<doi>10.1145/3325111</doi>
</citation>
<citation key="ref11">
<doi>10.1103/PhysRevLett.119.170501</doi>
</citation>
<citation key="ref12">
<doi>10.1103/PhysRevA.98.062322</doi>
</citation>
<citation key="ref13">
<doi>10.1103/PhysRevA.50.813</doi>
</citation>
<citation key="ref14">
<doi>10.1016/j.jmva.2007.01.013</doi>
</citation>
<citation key="ref15">
<doi>10.1002/(SICI)1098-2418(1999010)14:1</doi>
</citation>
<citation key="ref16">
<unstructured_citation>Quesada, Nicolas and Arrazola, Juan Miguel, The Classical Complexity of Gaussian Boson Sampling, 2019, arXiv preprint arXiv:1908.08068</unstructured_citation>
</citation>
<citation key="ref17">
<unstructured_citation>Classical benchmarking of Gaussian boson sampling on the Titan supercomputer, Gupt, Brajesh and Arrazola, Juan Miguel and Quesada, Nicolás and Bromley, Thomas R, arXiv preprint arXiv:1810.00900, 2018</unstructured_citation>
</citation>
<citation key="ref18">
<unstructured_citation>A quantum hardware-induced graph kernel based on Gaussian Boson Sampling, Schuld, Maria and Brádler, Kamil and Israel, Robert and Su, Daiqin and Gupt, Brajesh, arXiv preprint arXiv:1905.12646, 2019</unstructured_citation>
</citation>
<citation key="ref19">
<unstructured_citation>Molecular Docking with Gaussian Boson Sampling, Banchi, Leonardo and Fingerhuth, Mark and Babej, Tomas and Arrazola, Juan Miguel, arXiv preprint arXiv:1902.00462, 2019</unstructured_citation>
</citation>
<citation key="ref20">
<unstructured_citation>Point Processes with Gaussian Boson Sampling, Jahangiri, Soran and Arrazola, Juan Miguel and Quesada, Nicolás and Killoran, Nathan, arXiv preprint arXiv:1906.11972, 2019</unstructured_citation>
</citation>
<citation key="ref21">
<doi>10.22331/q-2019-03-11-129</doi>
</citation>
<citation key="ref22">
<doi>10.1088/0305-4470/34/31/312</doi>
</citation>
<citation key="ref23">
<unstructured_citation>Speedup in Classical Simulation of Gaussian Boson Sampling, Wu, Bujiao and Cheng, Bin and Zhang, Jialin and Yung, Man-Hong and Sun, Xiaoming, arXiv preprint arXiv:1908.10070, 2019</unstructured_citation>
</citation>
<citation key="ref24">
<unstructured_citation>Franck-Condon factors via compressive sensing, Valson Jacob, Kevin and Kaur, Eneet and Roga, Wojciech and Takeoka, Masahiro, arXiv preprint arXiv:1909.02935, 2019</unstructured_citation>
</citation>
<citation key="ref25">
<unstructured_citation>Tzitrin, Ilan and Bourassa, J. Eli and Menicucci, Nicolas C. and Sabapathy, Krishna Kumar, Towards practical qubit computation using approximate error-correcting grid states, 2019, arXiv preprint arXiv:1910.03673</unstructured_citation>
</citation>
</citation_list>
</journal_article>
</journal>
</body>
</doi_batch>
Binary file added joss.01705/10.21105.joss.01705.pdf
View file
Open in desktop
Binary file not shown.