PlumX Metrics
Embed PlumX Metrics

Exploring the quantum speed limit with computer games

Nature, ISSN: 1476-4687, Vol: 532, Issue: 7598, Page: 210-213
2016
  • 90
    Citations
  • 0
    Usage
  • 333
    Captures
  • 23
    Mentions
  • 271
    Social Media
Metric Options:   Counts1 Year3 Year

Metrics Details

  • Citations
    90
  • Captures
    333
  • Mentions
    23
    • Blog Mentions
      11
      • Blog
        11
    • News Mentions
      10
      • News
        10
    • References
      2
      • Wikipedia
        2
  • Social Media
    271
    • Shares, Likes & Comments
      271
      • Facebook
        271

Most Recent Blog

Gamers help satisfy the need for speed in quantum manipulations

The human brain can still outperform our best algorithms for a variety of tasks. Some tasks, like object identification, aren't really surprising—our brain itself has

Most Recent News

Quantum Computing Gets a Boost From AI and Crowdsourcing

Illustration: Greg Mably Anyone of a certain age who has even a passing interest in computers will remember the remarkable breakthrough that IBM made in 1997 when its Deep Blue chess-playing computer defeated Garry Kasparov, then the world chess champion. Computer scientists passed another such milestone in March 2016, when DeepMind (a subsidiary of Alphabet, Google’s parent company) announced tha

Article Description

Humans routinely solve problems of immense computational complexity by intuitively forming simple, low-dimensional heuristic strategies. Citizen science (or crowd sourcing) is a way of exploiting this ability by presenting scientific research problems to non-experts. 'Gamification'-the application of game elements in a non-game context-is an effective tool with which to enable citizen scientists to provide solutions to research problems. The citizen science games Foldit, EteRNA and EyeWire have been used successfully to study protein and RNA folding and neuron mapping, but so far gamification has not been applied to problems in quantum physics. Here we report on Quantum Moves, an online platform gamifying optimization problems in quantum physics. We show that human players are able to find solutions to difficult problems associated with the task of quantum computing. Players succeed where purely numerical optimization fails, and analyses of their solutions provide insights into the problem of optimization of a more profound and general nature. Using player strategies, we have thus developed a few-parameter heuristic optimization method that efficiently outperforms the most prominent established numerical methods. The numerical complexity associated with time-optimal solutions increases for shorter process durations. To understand this better, we produced a low-dimensional rendering of the optimization landscape. This rendering reveals why traditional optimization methods fail near the quantum speed limit (that is, the shortest process duration with perfect fidelity). Combined analyses of optimization landscapes and heuristic solution strategies may benefit wider classes of optimization problems in quantum physics and beyond.

Bibliographic Details

Sørensen, Jens Jakob W. H.; Pedersen, Mads Kock; Munch, Michael; Haikka, Pinja; Jensen, Jesper Halkjær; Planke, Tilo; Andreasen, Morten Ginnerup; Gajdacz, Miroslav; Mølmer, Klaus; Lieberoth, Andreas; Sherson, Jacob F.

Springer Science and Business Media LLC

Multidisciplinary

Provide Feedback

Have ideas for a new metric? Would you like to see something else here?Let us know