2013 · 22 citations · 34 references
ComputingComputer EngineeringComputer ScienceComputer ArchitectureFault-tolerant ComputingQuantum ComputingApproximation MethodsQuantum AlgorithmsQuantum BitsQuantum CircuitsQuantum ComputationQuantum Hardware ArchitecturesError Correction CodesQuantum Approximation AlgorithmsQuantum Computing ArchitectureQuantum Fault ToleranceQuantum RotationsRotationsShor's AlgorithmShor's Factoring Algorithm
Work in quantum computer architecture has focused on communication, layout and fault tolerance, largely driven by Shor's factorization algorithm. For the first time, we study a larger range of benchmarks and find that another critical issue is the generation of code sequences for quantum rotation operations. Specifically, quantum algorithms require arbitrary rotation angles, while quantum technologies and error correction codes provide only for discrete angles and operators. A sequence of quantum machine instructions must be generated to approximate the arbitrary rotation to the required precision.
34
A fast quantum mechanical algorithm for database search
Lov K. Grover · 1996 · 8.6K citations · Full text
Algorithms for quantum computation: discrete logarithms and factoring
Peter W. Shor · 2002 · 8.5K citations
Computing, Computer Science, Physics +12
Thaddeus D. Ladd, Fedor Jelezko, Raymond Laflamme et al. · Nature · 2010 · 3.5K citations · Full text
Quantum annealing with manufactured spins
Mark W. Johnson, M. H. S. Amin, S. Gildert et al. · Nature · 2011 · 1.9K citations