Tag: peter shor
Efficient quantum amplitude encoding of polynomial functions
Javier Gonzalez-Conde1,2, Thomas W. Watts3, Pablo Rodriguez-Grasa1,2,4, and Mikel Sanz1,2,5,61Department of Physical Chemistry, University of the Basque Country UPV/EHU, Apartado 644, 48080 Bilbao, Spain2EHU...
Breaking News
Rapid quantum approaches for combinatorial optimisation inspired by optimal state-transfer
Robert J. Banks1, Dan E. Browne2, and P.A. Warburton1,31London Centre for Nanotechnology, UCL, London WC1H 0AH, UK2Department of Physics and Astronomy, UCL, London WC1E...
General quantum algorithms for Hamiltonian simulation with applications to a non-Abelian lattice gauge theory
Zohreh Davoudi1,2,3,4, Alexander F. Shaw1,3, and Jesse R. Stryker1,2,51Department of Physics, University of Maryland, College Park, MD 20742, USA2Maryland Center for Fundamental Physics, University...
Shorter quantum circuits via single-qubit gate approximation
Vadym Kliuchnikov1,2, Kristin Lauter3, Romy Minko4,5, Adam Paetznick1, and Christophe Petit6,71Microsoft Quantum, Redmond, WA, US2Microsoft Quantum, Toronto, ON, CA3Facebook AI Research, Seattle, WA,...
Toby Cubitt: why algorithms will speed up applications of quantum computers – Physics World
Building quantum computers isn’t just about developing clever new hardware. Toby Cubitt, who co-founded the quantum-tech firm Phasecraft, tells Hamish Johnston...
A rapidly mixing Markov chain from any gapped quantum many-body system
Sergey Bravyi1, Giuseppe Carleo2, David Gosset3,4, and Yinchen Liu3,41IBM Quantum, IBM T.J. Watson Research Center, Yorktown Heights, USA2École Polytechnique Fédérale de Lausanne (EPFL),...
The Quest to Quantify Quantumness | Quanta Magazine
IntroductionIt’s been more than 40 years since the physicist Richard Feynman pointed out that building computing devices based on quantum principles could unlock powers...
On the role of entanglement in qudit-based circuit compression
Xiaoqin Gao1,2, Paul Appel2, Nicolai Friis3,2, Martin Ringbauer4, and Marcus Huber3,21Department of Physics, University of Ottawa, Advanced Research Complex, 25 Templeton Street, K1N 6N5,...
Heidelberg Laureates Warn Against a False Sense of Security with Current Encryption Methods » CCC Blog
During the 10th Heidelberg Laureate Forum last week, I had the opportunity to interview several of the laureates to hear their perspectives on current...
Quantum Computers Could Crack Encryption Sooner Than Expected With New Algorithm
One of the most well-established and disruptive uses for a future quantum computer is the ability to crack encryption. A new algorithm could significantly...
Who will win the Nobel Prize for Physics? Our predictions for 2023 – Physics World
It’s a mug’s game, we know, but we just can’t help ourselves here at Physics World when it comes to predicting...
Encoding trade-offs and design toolkits in quantum algorithms for discrete optimization: coloring, routing, scheduling, and other problems
Nicolas PD Sawaya1, Albert T Schmitz2, and Stuart Hadfield3,41Intel Labs, Intel Corporation, Santa Clara, California 95054, USA 2Intel Labs, Intel Corporation, Hillsboro, Oregon 97124,...
NIST Publishes First Draft Standards for Post-Quantum Cryptography
The first draft standards for quantum-resistant public key cryptography based on algorithms chosen by the National Institute for Standards and Technology (NIST) are now...