Trapped-ion quantum computing: Progress and challenges

CD Bruzewicz, J Chiaverini, R McConnell… - Applied Physics …, 2019 - pubs.aip.org
Trapped ions are among the most promising systems for practical quantum computing (QC).
The basic requirements for universal QC have all been demonstrated with ions, and …

Materials challenges and opportunities for quantum computing hardware

NP De Leon, KM Itoh, D Kim, KK Mehta, TE Northup… - Science, 2021 - science.org
BACKGROUND The past two decades have seen intense efforts aimed at building quantum
computing hardware with the potential to solve problems that are intractable on classical …

Quantum supremacy using a programmable superconducting processor

F Arute, K Arya, R Babbush, D Bacon, JC Bardin… - Nature, 2019 - nature.com
The promise of quantum computers is that certain computational tasks might be executed
exponentially faster on a quantum processor than on a classical processor 1. A fundamental …

Quantum computational chemistry

S McArdle, S Endo, A Aspuru-Guzik, SC Benjamin… - Reviews of Modern …, 2020 - APS
One of the most promising suggested applications of quantum computing is solving
classically intractable chemistry problems. This may help to answer unresolved questions …

[BOOK][B] Elements of causal inference: foundations and learning algorithms

J Peters, D Janzing, B Schölkopf - 2017 - library.oapen.org
A concise and self-contained introduction to causal inference, increasingly important in data
science and machine learning. The mathematization of causality is a relatively recent …

Qudits and high-dimensional quantum computing

Y Wang, Z Hu, BC Sanders, S Kais - Frontiers in Physics, 2020 - frontiersin.org
Qudit is a multi-level computational unit alternative to the conventional 2-level qubit.
Compared to qubit, qudit provides a larger state space to store and process information, and …

Algorithms for quantum computation: discrete logarithms and factoring

PW Shor - … 35th annual symposium on foundations of computer …, 1994 - ieeexplore.ieee.org
A computer is generally considered to be a universal computational device; ie, it is believed
able to simulate any physical computational device with a cost in computation time of at most …

Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer

PW Shor - SIAM review, 1999 - SIAM
A digital computer is generally believed to be an efficient universal computing device; that is,
it is believed to be able to simulate any physical computing device with an increase in …

Scheme for reducing decoherence in quantum computer memory

PW Shor - Physical review A, 1995 - APS
Recently, it was realized that use of the properties of quantum mechanics might speed up
certain computations dramatically. Interest has since been growing in the area of quantum …

Elementary gates for quantum computation

A Barenco, CH Bennett, R Cleve, DP DiVincenzo… - Physical review A, 1995 - APS
We show that a set of gates that consists of all one-bit quantum gates [U (2)] and the two-bit
exclusive-O R gate [that maps Boolean values (x, y) to (x, x⊕ y)] is universal in the sense …