Proof-of-work consensus by quantum sampling
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912223661654016 |
|---|---|
| author | Singh, Deepesh Muraleedharan, Gopikrishnan Fu, Boxiang Cheng, Chen-Mou Newton, Nicolas Roussy Rohde, Peter P. Brennen, Gavin K. |
| author_facet | Singh, Deepesh Muraleedharan, Gopikrishnan Fu, Boxiang Cheng, Chen-Mou Newton, Nicolas Roussy Rohde, Peter P. Brennen, Gavin K. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2305_19865 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Proof-of-work consensus by quantum sampling Singh, Deepesh Muraleedharan, Gopikrishnan Fu, Boxiang Cheng, Chen-Mou Newton, Nicolas Roussy Rohde, Peter P. Brennen, Gavin K. Quantum Physics General Finance 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. |
| title | Proof-of-work consensus by quantum sampling |
| topic | Quantum Physics General Finance |
| url | https://arxiv.org/abs/2305.19865 |