China
Africa
Explore chapters and articles related to this topic
Quantum Networks
Published in Jonathan P. Dowling, Schrödinger’s Web, 2020
We hit quantum supremacy in the fall of 2019. How is that possible? In my 2013 book, I predicted that this milestone was decades away. In March of 2019, I attended a conference called The Future of Quantum Computing, Quantum Cryptography, and Quantum Sensors, held in Boston. During a panel discussion on the threat of quantum computers to such things as blockchain, a panelist said, “I don’t see why we have to worry about a quantum computer that won’t be ready for 100 years when we’ll all be dead!” Here I sit, nine months later, writing about quantum supremacy. I can assure you that this panelist is still very much alive – only their business plan for securing blockchain against a quantum attack is dead.21 How did we hit quantum supremacy so quickly? The answer is in quantum Moore’s law.
From Hamiltonian to Temporal (t > 0) Mechanics
Published in Francis T. S. Yu, The Nature of Temporal (t > 0) Science, 2022
In this we see that all the wave functions are “super-imposing” together. This is precisely the fundamental principle of superposition of Schrodinger. Yet, this is the principle that Einstein “opposed” the most, as he commented: “mathematics is correct, but incomplete” published in the New York Times newspaper in 1935 [14]. And it is also the fundamental principle that quantum computing scientists are depending on; the “simultaneous and instantaneous” superposition that quantum theory can offer to develop a quantum supremacy computer. I will show that the superposition is a timeless (t = 0) principle, and it does “not” exist within our universe.
Quantum computing to solve scenario-based stochastic time-dependent shortest path routing
Published in Transportation Letters, 2023
Vinayak V. Dixit, Chence Niu, David Rey, S. Travis Waller, Michael W. Levin
There has been ground breaking theoretical work that demonstrated quantum algorithms relying on quantum logic gates can provide significant speedups, one of the most celebrated being the Shor’s algorithm (Shor 1994.), that demonstrated that quantum computers can solve the prime factorization problem exponentially faster than classical computers, having significant implications on cryptography. Recently ‘Quantum Supremacy’ was demonstrated on a problem that would take a classical supercomputer 10,000 years to be completed by 53 qubit Sycamore processor in 200 s (Arute et al. 2019). Applications of quantum algorithms in the field of transportation and traffic have been limited. Dixit and Jian (Dixit and Jian 2022a) used quantum gates for drive cycle analysis, that has applications to safety and emissions. Some other transportation problems such as traveling salesman problem, vehicle routing problem, traffic signals control problem, and traffic flow optimization problem have been investigated (Papalitsas et al. 2019; Warren 2020)– (Neukart et al. 2017).