Proof-of-work consensus by quantum sampling

被引:2
作者
Singh, Deepesh [1 ]
Muraleedharan, Gopikrishnan [2 ]
Fu, Boxiang [3 ]
Cheng, Chen-Mou [4 ]
Roussy Newton, Nicolas [4 ]
Rohde, Peter P. [2 ,5 ,6 ]
Brennen, Gavin K. [2 ]
机构
[1] Univ Queensland, Ctr Quantum Computat & Commun Technol, Sch Math & Phys, St Lucia, Qld, Australia
[2] Macquarie Univ, Ctr Engn Quantum Syst, Sch Math & Phys Sci, Macquarie Pk, NSW 2109, Australia
[3] Univ Melbourne, Sch Phys, Melbourne, Vic 3010, Australia
[4] BTQ Technol, 16-104 555 Burrard St, Vancouver, BC V7X 1M8, Canada
[5] Univ Technol Sydney, Ctr Quantum Software & Informat QSI, Ultimo, NSW 2007, Australia
[6] Louisiana State Univ, Hearne Inst Theoret Phys, Dept Phys & Astron, Baton Rouge, LA USA
基金
澳大利亚研究理事会;
关键词
proof of work; boson sampling; blockchain; quantum advantage; validation; COMPUTATIONAL ADVANTAGE;
D O I
10.1088/2058-9565/adae2b
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
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 miners 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 incentivises honest miners. 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.
引用
收藏
页数:30
相关论文
共 64 条
[1]  
Aaronson S, 2012, Arxiv, DOI arXiv:1212.0025
[2]  
Aaronson S, 2011, ACM S THEORY COMPUT, P333
[3]  
Aizpurua B, 2023, Arxiv, DOI arXiv:2311.02986
[4]   Near-Unity Coupling Efficiency of a Quantum Emitter to a Photonic Crystal Waveguide [J].
Arcari, M. ;
Sollner, I. ;
Javadi, A. ;
Hansen, S. Lindskov ;
Mahmoodian, S. ;
Liu, J. ;
Thyrrestrup, H. ;
Lee, E. H. ;
Song, J. D. ;
Stobbe, S. ;
Lodahl, P. .
PHYSICAL REVIEW LETTERS, 2014, 113 (09)
[5]  
Arkhipov A., 2012, GEOM TOPOL MONOG, V18, P1, DOI DOI 10.2140/GTM
[6]   BosonSampling is robust against small errors in the network matrix [J].
Arkhipov, Alex .
PHYSICAL REVIEW A, 2015, 92 (06)
[7]  
Arora S, 2009, COMPUTATIONAL COMPLEXITY: A MODERN APPROACH, P1, DOI 10.1017/CBO9780511804090
[8]  
Bailey R.E., 2005, The Economics of Financial Markets, DOI DOI 10.1017/CBO9780511817458
[9]   Coin.AI: A Proof-of-Useful-Work Scheme for Blockchain-Based Distributed Deep Learning [J].
Baldominos, Alejandro ;
Saez, Yago .
ENTROPY, 2019, 21 (08)
[10]  
Bernheim B D., 2014, Microeconomics, V2nd