Skip to main content
Cornell University
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arxiv logo > quant-ph > arXiv:2305.19865

Help | Advanced Search

arXiv logo
Cornell University Logo

quick links

  • Login
  • Help Pages
  • About

Quantum Physics

arXiv:2305.19865 (quant-ph)
[Submitted on 31 May 2023 (v1), last revised 29 Sep 2024 (this version, v3)]

Title:Proof-of-work consensus by quantum sampling

Authors:Deepesh Singh, Gopikrishnan Muraleedharan, Boxiang Fu, Chen-Mou Cheng, Nicolas Roussy Newton, Peter P. Rohde, Gavin K. Brennen
View a PDF of the paper titled Proof-of-work consensus by quantum sampling, by Deepesh Singh and 6 other authors
View PDF HTML (experimental)
Abstract:Since its advent in 2011, boson sampling has been a preferred candidate for demonstrating quantum advantage because of its simplicity and near-term requirements compared to other quantum algorithms. We propose to use a variant, called coarse-grained boson-sampling (CGBS), as a quantum Proof-of-Work (PoW) scheme for blockchain consensus. The users perform boson sampling using input states that depend on the current block information and commit their samples to the network. Afterwards, CGBS strategies are determined which can be used to both validate samples and reward successful miners. By combining rewards for miners committing honest samples together with penalties for miners committing dishonest samples, a Nash equilibrium is found that incentivizes honest nodes. We provide numerical evidence that these validation tests are hard to spoof classically without knowing the binning scheme ahead of time and show the robustness of our protocol to small partial distinguishability of photons. The scheme works for both Fock state boson sampling and Gaussian boson sampling and provides dramatic speedup and energy savings relative to computation by classical hardware.
Comments: 24 pages, 7 figures, 1 table (v3 Add more numerical simulation results)
Subjects: Quantum Physics (quant-ph); General Finance (q-fin.GN)
Cite as: arXiv:2305.19865 [quant-ph]
  (or arXiv:2305.19865v3 [quant-ph] for this version)
  https://doi.org/10.48550/arXiv.2305.19865
arXiv-issued DOI via DataCite
Journal reference: Quantum Sci. Technol. 10 025020 (2025)
Related DOI: https://doi.org/10.1088/2058-9565/adae2b
DOI(s) linking to related resources

Submission history

From: Gopikrishnan Muraleedharan [view email]
[v1] Wed, 31 May 2023 13:58:40 UTC (1,923 KB)
[v2] Fri, 12 Jan 2024 02:28:37 UTC (1,247 KB)
[v3] Sun, 29 Sep 2024 04:10:53 UTC (1,633 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled Proof-of-work consensus by quantum sampling, by Deepesh Singh and 6 other authors
  • View PDF
  • HTML (experimental)
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
quant-ph
< prev   |   next >
new | recent | 2023-05
Change to browse by:
q-fin
q-fin.GN

References & Citations

  • INSPIRE HEP
  • NASA ADS
  • Google Scholar
  • Semantic Scholar

2 blog links

(what is this?)
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack