11,693 research outputs found
Noise tolerant algorithms for learning and searching
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1995.Includes bibliographical references (p. 109-112).by Javed Alexander Aslam.Ph.D
Quantum Computing in the NISQ era and beyond
Noisy Intermediate-Scale Quantum (NISQ) technology will be available in the
near future. Quantum computers with 50-100 qubits may be able to perform tasks
which surpass the capabilities of today's classical digital computers, but
noise in quantum gates will limit the size of quantum circuits that can be
executed reliably. NISQ devices will be useful tools for exploring many-body
quantum physics, and may have other useful applications, but the 100-qubit
quantum computer will not change the world right away --- we should regard it
as a significant step toward the more powerful quantum technologies of the
future. Quantum technologists should continue to strive for more accurate
quantum gates and, eventually, fully fault-tolerant quantum computing.Comment: 20 pages. Based on a Keynote Address at Quantum Computing for
Business, 5 December 2017. (v3) Formatted for publication in Quantum, minor
revision
On the robustness of bucket brigade quantum RAM
We study the robustness of the bucket brigade quantum random access memory
model introduced by Giovannetti, Lloyd, and Maccone [Phys. Rev. Lett. 100,
160501 (2008)]. Due to a result of Regev and Schiff [ICALP '08 pp. 773], we
show that for a class of error models the error rate per gate in the bucket
brigade quantum memory has to be of order (where is the
size of the memory) whenever the memory is used as an oracle for the quantum
searching problem. We conjecture that this is the case for any realistic error
model that will be encountered in practice, and that for algorithms with
super-polynomially many oracle queries the error rate must be
super-polynomially small, which further motivates the need for quantum error
correction. By contrast, for algorithms such as matrix inversion [Phys. Rev.
Lett. 103, 150502 (2009)] or quantum machine learning [Phys. Rev. Lett. 113,
130503 (2014)] that only require a polynomial number of queries, the error rate
only needs to be polynomially small and quantum error correction may not be
required. We introduce a circuit model for the quantum bucket brigade
architecture and argue that quantum error correction for the circuit causes the
quantum bucket brigade architecture to lose its primary advantage of a small
number of "active" gates, since all components have to be actively error
corrected.Comment: Replaced with the published version. 13 pages, 9 figure
A Genetic Algorithm Tool (splicer) for Complex Scheduling Problems and the Space Station Freedom Resupply Problem
The Space Station Freedom will require the supply of items in a regular fashion. A schedule for the delivery of these items is not easy to design due to the large span of time involved and the possibility of cancellations and changes in shuttle flights. This paper presents the basic concepts of a genetic algorithm model, and also presents the results of an effort to apply genetic algorithms to the design of propellant resupply schedules. As part of this effort, a simple simulator and an encoding by which a genetic algorithm can find near optimal schedules have been developed. Additionally, this paper proposes ways in which robust schedules, i.e., schedules that can tolerate small changes, can be found using genetic algorithms
- …