Equal cost of computation for truth and falsity of experimental quantum propositions necessitates quantum parallel computing

• URL: http://arxiv.org/abs/2001.00913v1
• Date: Fri, 3 Jan 2020 18:01:03 GMT
• Title: Equal cost of computation for truth and falsity of experimental quantum propositions necessitates quantum parallel computing
• Authors: Arkady Bolotin
• Abstract summary: equal cost of computation for truth and falsity of experimental quantum propositions cannot be achieved with classical computing. On the other hand, this equality might be realized with quantum parallel computing provided that the efficiency of such computing can be greater than 1.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Notwithstanding interest and excitement building around quantum computing in the last decades, a concise statement saying where this computing can truly help is still missing. As it is shown in the present paper, equal cost of computation for truth and falsity of experimental quantum propositions (required in order to infer a conclusion from a premise) cannot be achieved with classical computing. On the other hand, this equality might be realized with quantum parallel computing provided that the efficiency of such computing can be greater than 1.

Related papers

• What is computable and non-computable in the quantum domain: 7 statements and 3 conjectures [0.7892577704654171]
  There is no universal approach that helps to define a scope of problems that quantum computers are able to speed up. On the one hand, the class of quantum states that is of interest for quantum computing should be complex. On the other hand, such quantum states should be reachable on a practical quantum computer.
  arXiv  Detail & Related papers  (2024-03-25T15:47:35Z)
• On the Theory of Quantum and Towards Practical Computation [0.0]
  It is an article that will bridge the vast gap between classical and quantum computation. We are indeed in luck to be living in an age where computing is being reinvented.
  arXiv  Detail & Related papers  (2024-02-07T20:50:35Z)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
  We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources. The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
  arXiv  Detail & Related papers  (2022-09-16T02:37:32Z)
• Is there evidence for exponential quantum advantage in quantum chemistry? [45.33336180477751]
  The idea to use quantum mechanical devices to simulate other quantum systems is commonly ascribed to Feynman. It may be prudent to assume exponential speedups are not generically available for this problem.
  arXiv  Detail & Related papers  (2022-08-03T16:33:57Z)
• Establishing trust in quantum computations [0.0]
  We introduce a technique for measuring the fidelity with which an as-built quantum computer can execute an algorithm. Our technique converts the algorithm's quantum circuits into a set of closely related circuits whose success rates can be efficiently measured.
  arXiv  Detail & Related papers  (2022-04-15T17:44:30Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Quantum reservoir computation utilising scale-free networks [0.0]
  We introduce a new reservoir computational model for pattern recognition showing a quantum advantage utilizing scale-free networks. The simplicity in our approach illustrates the computational power in quantum complexity as well as provide new applications for such processors.
  arXiv  Detail & Related papers  (2021-08-27T06:28:08Z)
• Depth-efficient proofs of quantumness [77.34726150561087]
  A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover. In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
  arXiv  Detail & Related papers  (2021-07-05T17:45:41Z)
• Categorical computation [7.452142897055281]
  In quantum computing, the computation is achieved by linear operators in or between Hilbert spaces. In this work, we explore a new computation scheme, in which the linear operators in quantum computing are replaced by (higher) functors between two (higher) categories.
  arXiv  Detail & Related papers  (2021-02-09T13:32:58Z)
• An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
  We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem. The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
  arXiv  Detail & Related papers  (2020-05-06T14:18:44Z)

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.