.png){kind=icon}
.png){kind=icon}
Return
Shrinking quantum randomization
.png){kind=icon}
PRE
AI
DOI：10.1126/science.adz0147.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
When rolling a dice, each of the six faces appears randomly with equal probability. This simple phenomenon of randomness plays a key role in many technologies such as cryptography (1), complex physical simulations (2), and magnetic resonance imaging (3). In classical computer science, randomized algorithms can perform more efficient computation with less memory use compared to algorithms that follow deterministic paths (4). Randomness also has an important technological role in quantum computing, but generating this requires a large number of operations. On page 92 of this issue, Schuster et al. (5) report a quantum circuit (an abstract sequence of actions for computation) that achieves randomness with an exponentially reduced number of operations. This lowers the engineering barrier for achieving fast and efficient quantum computing in various applications.