Quantum Computer Can Not Speed Up Iterated Applications of a Black Box

Ozhigov, Yuri I.

doi:10.1007/3-540-49208-9_12

Cited by 12 publications

(13 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…. [11]), some are sped up moderately (locating an entry in a database of n entries [12]), and some are apparently sped up exponentially (Shor's algorithm for factoring an n-digit number [13]).…”

mentioning

confidence: 99%

The Physical Implementation of Quantum Computation

DiVincenzo¹

2000

Scalable Quantum Computers

360

443

View full text Add to dashboard Cite

After a brief introduction to the principles and promise of quantum information processing, the requirements for the physical implementation of quantum computation are discussed. These five requirements, plus two relating to the communication of quantum information, are extensively explored and related to the many schemes in atomic physics, quantum optics, nuclear and electron magnetic resonance spectroscopy, superconducting electronics, and quantum-dot physics, for achieving quantum computing. * Prepared for Fortschritte der Physik special issue, Experimental Proposals for Quantum Computation, eds. H.-K. Lo and S. Braunstein.

show abstract

mentioning

confidence: 99%

The Physical Implementation of Quantum Computation

DiVincenzo¹

2000

Scalable Quantum Computers

360

443

View full text Add to dashboard Cite

show abstract

“…However, quantum tools simply do not speed up all computing by a certain uniform amount. Some tasks are not sped up at all by using quantum tools 5, 6, some are sped up moderately 7, and some are sped up exponentially 8. Furthermore, there are tasks such as quantum cryptography that provide an absolute secrecy of communication between parties.…”

Section: Introductionmentioning

confidence: 99%

Binding of chlorpheniramine maleate to pharmacologically important alginic acid, carboxymethylcellulose, κ‐carageenan, and ι‐carrageenan as studied by diafiltration

Moreno‐Villoslada

Oyarzún

Miranda

et al. 2005

J of Applied Polymer Sci

View full text Add to dashboard Cite

ABSTRACT:The binding of cationic chlorpheniramine maleate (CPM) to the anionic water-soluble polymers (WSPs) alginic acid, carboxymethylcellulose, -carageenan, and -carageenan was evaluated by diafiltration at pH 7.5 and in the absence and presence of 0.13M NaCl. CPM interacted with all of the WSPs when no NaCl was present in the solution, with charge-related formation constants of around 700 M Ϫ1 for all of the polymers, whereas the interactions were cleaved in the presence of 0.13M NaCl, indicating interactions of an electrostatic nature screened by the single electrolyte.

show abstract

“…However, quantum tools simply do not speed up all computing by a certain uniform amount. Some tasks are not sped up at all by using quantum tools [5,6], some are sped up moderately [7], and some are sped up exponentially [8]. Furthermore, there are tasks such as quantum cryptography that provide an absolute secrecy of communication between parties.…”

mentioning

confidence: 99%

Quantum computing measurement and intelligence

Ezziane

2009

Int J of Quantum Chemistry

View full text Add to dashboard Cite

ABSTRACT:One of the grand challenges in the nanoscopic computing era is guarantees of robustness. Robust computing system design is confronted with quantum physical, probabilistic, and even biological phenomena, and guaranteeing highreliability is much more difficult than ever before. Scaling devices down to the level of single electron operation will bring forth new challenges due to probabilistic effects and uncertainty in guaranteeing "zero-one" based computing. Minuscule devices imply billions of devices on a single chip, which may help mitigate the challenge of uncertainty by replication and redundancy. However, such device densities will create a design and validation nightmare with the sheer scale. The questions that confront computer engineers regarding the current status of nanocomputing material and the reliability of systems built from such minuscule devices are difficult to articulate and answer. This article illustrates and discusses two types of quantum algorithms as follows: (1) a simple quantum algorithm and (2) a quantum search algorithm. This article also presents a review of recent advances in quantum computing and intelligence and presents major achievements and obstacles for researchers in the near future.

show abstract

Quantum Computer Can Not Speed Up Iterated Applications of a Black Box

Cited by 12 publications

References 4 publications

The Physical Implementation of Quantum Computation

The Physical Implementation of Quantum Computation

Binding of chlorpheniramine maleate to pharmacologically important alginic acid, carboxymethylcellulose, κ‐carageenan, and ι‐carrageenan as studied by diafiltration

Quantum computing measurement and intelligence

Contact Info

Product

Resources

About