scholarly journals Quantum Memory Hierarchies: Efficient Designs to Match Available Parallelism in Quantum Computing

Author(s):  
D.D. Thaker ◽  
T.S. Metodi ◽  
A.W. Cross ◽  
I.L. Chuang ◽  
F.T. Chong
2006 ◽  
Vol 34 (2) ◽  
pp. 378-390 ◽  
Author(s):  
Darshan D. Thaker ◽  
Tzvetan S. Metodi ◽  
Andrew W. Cross ◽  
Isaac L. Chuang ◽  
Frederic T. Chong

2007 ◽  
Vol 9 (6) ◽  
pp. 203-203 ◽  
Author(s):  
Michael Varnava ◽  
Daniel E Browne ◽  
Terry Rudolph

2011 ◽  
Vol 106 (24) ◽  
Author(s):  
Alexandre M. Souza ◽  
Gonzalo A. Álvarez ◽  
Dieter Suter

2019 ◽  
Author(s):  
Mark Fingerhuth ◽  
Tomáš Babej ◽  
Peter Wittek

2018 ◽  
Author(s):  
Rajendra K. Bera

It now appears that quantum computers are poised to enter the world of computing and establish its dominance, especially, in the cloud. Turing machines (classical computers) tied to the laws of classical physics will not vanish from our lives but begin to play a subordinate role to quantum computers tied to the enigmatic laws of quantum physics that deal with such non-intuitive phenomena as superposition, entanglement, collapse of the wave function, and teleportation, all occurring in Hilbert space. The aim of this 3-part paper is to introduce the readers to a core set of quantum algorithms based on the postulates of quantum mechanics, and reveal the amazing power of quantum computing.


Sign in / Sign up

Export Citation Format

Share Document