Prospects for quantum computing: Extremely doubtful

@article{Dyakonov2014ProspectsFQ,
  title={Prospects for quantum computing: Extremely doubtful},
  author={M. Dyakonov},
  journal={arXiv: Quantum Physics},
  year={2014},
  volume={33},
  pages={1460357}
}
  • M. Dyakonov
  • Published 2014
  • Physics, Mathematics
  • arXiv: Quantum Physics
  • The quantum computer is supposed to process information by applying unitary transformations to 2N complex amplitudes defining the state of N qubits. A useful machine needing N~103 or more, the number of continuous parameters describing the state of a quantum computer at any given moment is at least 21000 ~10300 which is much greater than the number of protons in the Universe. However, the theorists believe that the feasibility of large-scale quantum computing has been proved via the “threshold… CONTINUE READING
    Implementing Grover’s Algorithm on the IBM Quantum Computers
    • 8
    • Open Access
    What determines the ultimate precision of a quantum computer
    • 2
    • Open Access
    Theory of quantum control landscapes: Overlooked hidden cracks
    • 4
    • Open Access

    References

    Publications referenced by this paper.
    SHOWING 1-9 OF 9 REFERENCES
    Fault-tolerant quantum computation with constant error
    • 518
    • Open Access
    Fault-Tolerant Quantum Computation with Constant Error Rate
    • 243
    • Open Access
    Is Fault-Tolerant Quantum Computation Really Possible?
    • 28
    • Open Access
    Revisiting the hopes for scalable quantum computation
    • 5
    • Open Access
    Quantum computing: A view from the enemy camp
    • 18
    • Open Access
    Nonlinear Systems: Analysis, Stability, and Control
    • 1,733
    • Open Access
    The Tale of One-Way Functions
    • L. Levin
    • Computer Science, Mathematics
    • 2003
    • 80
    • Open Access
    Obituary: Rolf Landauer (1927-99)
    • 52