Proof-of-work consensus by quantum sampling
- URL: http://arxiv.org/abs/2305.19865v2
- Date: Fri, 12 Jan 2024 02:28:37 GMT
- 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
- Abstract summary: 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.
By combining rewards to miners committing honest samples together with penalties to miners committing dishonest samples, a Nash equilibrium is found that incentivizes honest nodes.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- 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. Afterward, CGBS strategies are determined which can be used to
both validate samples and to reward successful miners. By combining rewards to
miners committing honest samples together with penalties to miners committing
dishonest samples, a Nash equilibrium is found that incentivizes honest nodes.
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.
Related papers
- Honeybee: Decentralized Peer Sampling with Verifiable Random Walks for Blockchain Data Sharding [6.120657470247715]
Key challenge toward implementing sharding is verifying whether the entirety of a block's data is available in the network.
We present a primitive sampling algorithm for present nodes that uses random nodes.
We show that the quality achieved by Honeybee is significantly better compared to the state-of-the-art sampling algorithm.
arXiv Detail & Related papers (2024-02-25T21:29:44Z) - Counting collisions in random circuit sampling for benchmarking quantum
computers [0.7252027234425332]
We show that counting the number of collisions when measuring a random quantum circuit provides a practical benchmark for the quality of a quantum computer.
We show that this quantity, if properly normalized, can be used as a "collision anomaly" benchmark or as a "collision volume" test.
arXiv Detail & Related papers (2023-12-07T11:12:30Z) - Experimental anonymous quantum conferencing [72.27323884094953]
We experimentally implement the AQCKA task in a six-user quantum network using Greenberger-Horne-Zeilinger (GHZ)-state entanglement.
We also demonstrate that the protocol retains an advantage in a four-user scenario with finite key effects taken into account.
arXiv Detail & Related papers (2023-11-23T19:00:01Z) - Verifiable measurement-based quantum random sampling with trapped ions [0.7978498178655667]
Quantum computers are now on the brink of outperforming their classical counterparts.
One way to demonstrate the advantage is through quantum random sampling performed on quantum computing devices.
Here, we experimentally demonstrate efficiently verifiable quantum random sampling in the measurement-based model of quantum computation.
arXiv Detail & Related papers (2023-07-26T18:00:03Z) - A hybrid quantum-classical approach for inference on restricted
Boltzmann machines [1.0928470926399563]
A Boltzmann machine is a powerful machine learning model with many real-world applications.
Statistical inference on a Boltzmann machine can be carried out by sampling from its posterior distribution.
Quantum computers have the promise of solving some non-trivial problems in an efficient manner.
arXiv Detail & Related papers (2023-03-31T11:10:31Z) - Certified Randomness from Quantum Supremacy [5.313318620422295]
We propose an application for near-term quantum devices, namely, generating cryptographically certified random bits.
Our protocol repurposes the existing "quantum supremacy" experiments, based on random circuit sampling.
We show that our protocol's output is unpredictable even to a computationally unbounded adversary.
arXiv Detail & Related papers (2023-03-02T23:28:31Z) - Importance sampling for stochastic quantum simulations [68.8204255655161]
We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients.
We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage.
Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
arXiv Detail & Related papers (2022-12-12T15:06:32Z) - Efficient Bipartite Entanglement Detection Scheme with a Quantum
Adversarial Solver [89.80359585967642]
Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits.
We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
arXiv Detail & Related papers (2022-03-15T09:46:45Z) - Cluster-Promoting Quantization with Bit-Drop for Minimizing Network
Quantization Loss [61.26793005355441]
Cluster-Promoting Quantization (CPQ) finds the optimal quantization grids for neural networks.
DropBits is a new bit-drop technique that revises the standard dropout regularization to randomly drop bits instead of neurons.
We experimentally validate our method on various benchmark datasets and network architectures.
arXiv Detail & Related papers (2021-09-05T15:15:07Z) - Reparameterized Sampling for Generative Adversarial Networks [71.30132908130581]
We propose REP-GAN, a novel sampling method that allows general dependent proposals by REizing the Markov chains into the latent space of the generator.
Empirically, extensive experiments on synthetic and real datasets demonstrate that our REP-GAN largely improves the sample efficiency and obtains better sample quality simultaneously.
arXiv Detail & Related papers (2021-07-01T10:34:55Z) - Quantum Communication Complexity of Distribution Testing [114.31181206328276]
Two players each receive $t$ samples from one distribution over $[n]$.
The goal is to decide whether their two distributions are equal, or are $epsilon$-far apart.
We show that the quantum communication complexity of this problem is $tildeO$(tepsilon2))$ qubits when distributions have low $l$-norm.
arXiv Detail & Related papers (2020-06-26T09:05:58Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.