China
Africa
Explore chapters and articles related to this topic
Quantum Computing and Quantum Cryptography
Published in T. Ananth Kumar, T. S. Arun Samuel, R. Dinesh Jackson Samuel, M. Niranjanamurthy, Privacy and Security Challenges in Cloud Computing, 2022
B. Sheik Mohamed, M. Satheesh Kumar, K.G. Srinivasagan
In 2019, Google claimed that they achieved quantum supremacy with an array of 54 qubits of which 53 were functional. They tested with sequences of problems and calculations using the quantum computer and completed the operations in <4 minutes. Google claimed that the same set of problems can be solved by a supercomputer in 10,000 years. But IBM reported that the claim of 10,000 years for a supercomputer is a hugely exaggerated figure and they added that the supercomputer will take 60 hours to complete the same set of problems. Still, the 4 minutes completion by quantum computing compared with 60 hours of supercomputing is considerably promising. By the end of 2020, a group of researchers from University of Science and Technology of China (USTC) accomplished quantum supremacy by employing a type of boson sampling on 76 photons with their photonic quantum computer, Jiuzhang, which has magnificently conducted a Gaussian boson sampling task in 200 seconds, whereas the same task is expected to be completed in an estimated time of half a billion years on the fastest traditional non-quantum computer. The USTC researchers claimed that Jiuzhang is 10 billion times faster than Google’s superconductor-based Sycamore processor, becoming the second computer to attain quantum supremacy.
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).