DOCSLIB.ORG

The Physics of Energy Robert L. Jaffe , Washington Taylor Index More Information

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
The Physics of Energy Robert L. Jaffe , Washington Taylor Index More Information Cambridge University Press 978-1-107-01665-1 — The Physics of Energy Robert L. Jaffe , Washington Taylor Index More Information Index 1st law efficiency, see efficiency, 1st law aeolipile, 246 anhydrite, 662 2nd law efficiency, see efficiency, 2nd law aerosols, 699 anode, 784 air conditioner, see also heat extraction Antarctic Circumpolar Current (ACC), ablation, 369, 719 device, 199 526, 616 absolute zero, 71 analysis of, 243ff Antarctica, 733 absorbed dose, 381 air mass A spectrum, 441 anthracite, 648 absorption, 438 air resistance, 19ff anthropic principle, 417 coefficient, 380, 438, 689 air standard analysis, 206 anti-knock additive, 209, 211 absorption refrigerator, 744 airfoil, 572 anticline, 661 427 absorptivity, 99, ALARA, see as low as reasonably anticyclone, 535 515 abyss, achievable antilinear, 838 AC, see current, alternating albedo, 682 antineutrino, 271 AC power, 50 feedback, 705 antiparticle, 8, 271 ACC, see Antarctic Circumpolar Current alkanes, see paraffins aphelion, 434 acceleration, 13 alkenes, see olefins API gravity, 660 centripetal, 23, 517 alkynes, see acetylenes apparent thermal conductivity, 95 acceptance angle, 455 α-amylase, 506 aqueous solution, 784 acceptor state, 480 α-decay, 313ff Arctic climate, 730 acetylenes, 209 α-particle, 277, 313, 373 Arctic sea ice, 725 acid mine drainage, 653 AM1.5, see air mass A spectrum arenes, see aromatic hydrocarbons acidification (of ocean), 735 americium argon, 75, 102 acidity, 735 241Am, 399 armature, 50, 807 acoustic impedance, 651 ammonia, 673 aromatic hydrocarbons, 209 actinide, 324 ampere (unit, A), 35 as fuel additive, 211 action at a distance, 30 Ampere’s law, 42 Arrhenius clock, 659, 660 activation barrier, 158 Ampere–Maxwell law, 53 Arrhenius equation, 660 activation energy, 660 amplitude, 58 ARS, see acute radiation syndrome active safety system, 353 amylopectin, 497 as low as reasonably achievable activity, 381 amylose, 497 (ALARA), 389 actuator disk, 578 anaerobic digester, 503 ash content, 649 acute radiation syndrome (ARS), 384 anaerobic digestion, 503 asphalt, 658, 660 adaptation to climate change, 736 Anderson–Flory–Schulz distribution, 675 asthenosphere, 622 adiabat, 189, 190 anemometer, 544 Atkinson cycle, 214 adiabatic expansion, 189 angle of attack, 572, 584 atmosphere (Earth), 685ff of air, 191 critical, 573 constituents of, 687 adiabatic index, 80, 190 angle of incidence (of sunlight), 434 global mean (1D) model, 689 adiabatic process, 189 angular frequency, 16 infrared absorption in, 688 adjoint, 838 angular induction factor, 581 atmosphere (unit, atm), 6 advanced gas-cooled reactor (AGR), 360 angular momentum, 23 atmospheric boundary layer, see also advanced recovery methods, 663 angular velocity, 22 planetary boundary layer, 539 © in this web service Cambridge University Press www.cambridge.org Cambridge University Press 978-1-107-01665-1 — The Physics of Energy Robert L. Jaffe , Washington Taylor Index More Information 858 Index atmospheric circulation, 523 β+-decay, 277 Bragg peak, 377, 378 primary, 533 β-particle, see also electron, 373 Brayton cycle, 255 secondary, 533 Bethe radiation formula, 375 breakdown voltage, 34 tertiary, 538 Betz limit, 544, 545, 613, 743 breakeven, 365 atomic (mass) number, 273, 301 actuator disk derivation of, 580 breeder reactor, 356 atomic binding, 171ff ballistic derivation of, 545 fast, 331, 357 atomic mass unit (unit, u), 302 big bang, 416 sodium cooled, 357 ATP, 496 big bang theory, 412 breeding nuclear fuel, 291, 295, 331, 355ff synthase, 496 binary cycle, 632 bremsstrahlung, 364, 377 attenuation coefficient, 374, 380 binding energy, 300, 301 Brillouin zone, 470 attenuation length, 380 of hydrogen atom, 133, 171 in 3D, 477 automobile, see car per nucleon, 308 BTX, 666 available work, 639, 742, 748 biobutanol, 511 bulk modulus, 651 Avogadro’s number, 71 biodiesel, 217, 509 buoyancy, see force, buoyancy axial compressor, 243 biofuel, 504 burner reactor, 356 axial induction factor, 579 first-generation, 508 bus(bar), 814 axial-momentum theory, 578 second-generation, 508 butanol, 511 503 BWR, see boiling water reactor back-EMF, 48 biogas, biomarker, 659 backwork, 255 CO2 abatement, 757 biomass, 502 bagasse, 505 C3 plant, 498 biosphere, 681 balancing region, 824 C4 plant, 498 band, 467 in GCM, 703 cadmium, 491 quantum origin, 468ff bit, 119, 138 cadmium telluride (CdTe), 477, 491 band gap, 473 bitumen, 658, 660 CAES, see compressed air energy storage direct, 477, 490 bituminization, 648 calcination, 173, 176 indirect, 477 bituminous sands, see tar sands, 664 calcium carbonate, 173, 722 barn (unit, b), 325 black body, see also radiation, blackbody, calcium oxide, 173 barrage, see tidal barrage 99, 425 Calorie (unit, Cal), 8 barrel (unit, b), 660 radiative equilibrium of, 447 Calvin–Benson–Bassham (CBB) cycle, barrel of oil equivalent (BOE), 660 black carbon, 700 498 barrier penetration, 283 black hole, 416 camber, 572 barrier penetration factor, 285, 315 black light, 373 camshaft, 205 baryon, 173, 273 black soot, 701 CANDU reactor, 357 baryon number, see also atomic number, blade-element theory, 583 capacitance, 33 301 blowdown, 212 capacitive load, 809 conservation of, 273 BOE, see barrel of oil equivalent capacitor, 33ff baryonic matter, 416 Bohr radius, 133 energy storage in, 794 basalt, 622 boiler, 249 parallel plate, 33 basis vector, 837 boiling, 221, see also phase transition, capacitor bank, 817 bathymetry, 610 vaporization, 223 capacity factor, 461 battery, 784 boiling water reactor (BWR), 357 car alkaline, 785 Boltzmann constant, 73 electric, 788 efficiency of, 787 Boltzmann distribution, 150ff, 151, 473, flywheel in, 795 lead-acid, 786 686 carbohydrate, 497 lithium-ion, 786 Boltzmann factor, 151, 481 carbon nickel-cadmium (NiCd), 786 Bordeaux wines, 395 14C, 393 nickel-metal hydride (NiMH), 786 borehole logging, 650, 662 14C Baumann rule, 639 boron in paleoclimatology, 714 BDC, see bottom-dead-center 10B, 343 carbon capture and sequestration, 736 becquerel (unit, Bq), 381 boson, 155, 270, 289 carbon cycle, 696 Bénard cell, 98 bottom quark, 271, 274 carbon dioxide (CO2), 4, 440 benthic ecosystem, 716 bottom-dead-center (BDC), 205 absorption factor, 698 benzene, 209, 666 bottoming cycle, 256 anthropogenic, 697 Bernoulli’s equation, 238, 558, 561 boundary condition, 105 atmospheric time scale of, 726 β-decay, 271, 275, 302, 316, 326, 377 boundary layer, 95, 221, 564, 565 concentration of, 697 © in this web service Cambridge University Press www.cambridge.org Cambridge University Press 978-1-107-01665-1 — The Physics of Energy Robert L. Jaffe , Washington Taylor Index More Information Index 859 emissions of, 697 choked well, 639 coal power plant, 654ff ocean and land sinks, 698 chondrite meteorite, 624 emissions, 655 carbon sink chord (length), 572 fixed-bed, 654 land, 725 chord line, 572 fluidized bed, 654 ocean, 725 CHP, see combined heat and power IGCC, 655 Carboniferous period, 649 chromodynamic force, see force, stoker, 654 Carnot cycle, 191 chromodynamic ultra-supercritical (USC), 654 Carnot engine, 191ff CI, see compression ignition coalification, 648 Carnot heat extraction cycle, 200 CIGS, 491 coefficient Carnot limit, 149, 192 circuit drag, 12, 20, 573 catagenesis, 658 primary, 52 drawdown, 636 catalytic cracking, 665 secondary, 52 lift, 573 catalytic reforming, 665 circulation, 563 coefficient of performance (CoP), 199,742 cathode, 784 classical physics, 72 coefficient of void cathode ray, 271 from quantum physics, 131, 408 negative, 353 cathode ray tube (CRT), 395 classically forbidden zone, 282 positive, 353 causal time evolution, 137 clathrate, 671 cogeneration, 246, 257 causally connected events, 410 clay mineral, 722 cogeneration efficiency, 258 CCR, see critical compression ratio climate, 681 coherent waves, 68 CCS, see carbon capture and sequestration past, 710 coke, 653 CdTe, see cadmium telluride predictions, 724 cold air standard analysis, 206 cell climate change collection efficiency, 474 primary, 785 anthropogenic, 714 collective effective dose, 384 secondary, 785 effects of, 729 color charge, 273 cell voltage, 784 time scale of, 725ff combined cycle gas turbine, 254ff, 256 cellulase, 508 climate feedbacks, 701ff combined heat and power (CHP), 258 cellulose, 507 climate sensitivity parameter, 702 combustion, 175 cement, 173 closed surface, 39, 836 of hydrocarbons, 209 center-of-mass frame, 25 closed system, 405 committed effective dose, 383 centrifugal compressor, 243 closed-cycle engine, 183 compact linear Fresnel reflector (CLFR), centrifugation, 398 clouds, 692, 693 461 cetane number, 217 feedback, 705 complex carbohydrate, 497 CFC, see chlorofluorocarbon in GCM, 704 complex conjugate, 837 CFD, see computational fluid dynamics clumping (of nuclear fuel), 343 complex number, 836 chain reaction, 292 CMB, see cosmic microwave background compound nucleus, 328 chalcopyrite, 178, 491 radiation, see core–mantle boundary compound parabolic concentrator (CPC), chaotic system, 704 CNG, see compressed natural gas 457 charge CNO cycle, 424 compressed air energy storage (CAES), conservation of, 38 CO2, see carbon dioxide 778ff density, 31 CO2 intensity, 178 adiabatic, 780 electric, 29 coal, 647ff advanced-adiabatic, 780 magnetic, 41, 42 bituminous, 648 diabatic, 780 absence in nature, 42 black, 648 isothermal, 779 charged lepton, 270, 272 brown, 648 compressed natural gas (CNG), 672 charm quark, 271, 274 proven reserves, 647, 657 compressibility chemical feedstock, 666 quality of, 649 isothermal, 86 chemical weathering, 722 sub-bituminous, 648 compression ignition (CI), 215 chemotroph, 495 type of, 649
Load more

Recommended publications
  • Regularity and Symmetry As a Base for Efficient Realization of Reversible Logic Circuits
    Portland State University PDXScholar Electrical and Computer Engineering Faculty Publications and Presentations Electrical and Computer Engineering 2001 Regularity and Symmetry as a Base for Efficient Realization of Reversible Logic Circuits Marek Perkowski Portland State University, [email protected] Pawel Kerntopf Technical University of Warsaw Andrzej Buller ATR Kyoto, Japan Malgorzata Chrzanowska-Jeske Portland State University Alan Mishchenko Portland State University SeeFollow next this page and for additional additional works authors at: https:/ /pdxscholar.library.pdx.edu/ece_fac Part of the Electrical and Computer Engineering Commons Let us know how access to this document benefits ou.y Citation Details Perkowski, Marek; Kerntopf, Pawel; Buller, Andrzej; Chrzanowska-Jeske, Malgorzata; Mishchenko, Alan; Song, Xiaoyu; Al-Rabadi, Anas; Jozwiak, Lech; and Coppola, Alan, "Regularity and Symmetry as a Base for Efficient Realization of vRe ersible Logic Circuits" (2001). Electrical and Computer Engineering Faculty Publications and Presentations. 235. https://pdxscholar.library.pdx.edu/ece_fac/235 This Conference Proceeding is brought to you for free and open access. It has been accepted for inclusion in Electrical and Computer Engineering Faculty Publications and Presentations by an authorized administrator of PDXScholar. Please contact us if we can make this document more accessible: [email protected]. Authors Marek Perkowski, Pawel Kerntopf, Andrzej Buller, Malgorzata Chrzanowska-Jeske, Alan Mishchenko, Xiaoyu Song, Anas Al-Rabadi, Lech Jozwiak, and Alan Coppola This conference proceeding is available at PDXScholar: https://pdxscholar.library.pdx.edu/ece_fac/235 Regularity and Symmetry as a Base for Efficient Realization of Reversible Logic Circuits Marek Perkowski, Pawel Kerntopf+, Andrzej Buller*, Malgorzata Chrzanowska-Jeske, Alan Mishchenko, Xiaoyu Song, Anas Al-Rabadi, Lech Jozwiak@, Alan Coppola$ and Bart Massey PORTLAND QUANTUM LOGIC GROUP, Portland State University, Portland, Oregon 97207-0751.
    [Show full text]
  • Optimization of Reversible Circuits Using Toffoli Decompositions with Negative Controls
    S S symmetry Article Optimization of Reversible Circuits Using Toffoli Decompositions with Negative Controls Mariam Gado 1,2,* and Ahmed Younes 1,2,3 1 Department of Mathematics and Computer Science, Faculty of Science, Alexandria University, Alexandria 21568, Egypt; [email protected] 2 Academy of Scientific Research and Technology(ASRT), Cairo 11516, Egypt 3 School of Computer Science, University of Birmingham, Birmingham B15 2TT, UK * Correspondence: [email protected]; Tel.: +203-39-21595; Fax: +203-39-11794 Abstract: The synthesis and optimization of quantum circuits are essential for the construction of quantum computers. This paper proposes two methods to reduce the quantum cost of 3-bit reversible circuits. The first method utilizes basic building blocks of gate pairs using different Toffoli decompositions. These gate pairs are used to reconstruct the quantum circuits where further optimization rules will be applied to synthesize the optimized circuit. The second method suggests using a new universal library, which provides better quantum cost when compared with previous work in both cost015 and cost115 metrics; this proposed new universal library “Negative NCT” uses gates that operate on the target qubit only when the control qubit’s state is zero. A combination of the proposed basic building blocks of pairs of gates and the proposed Negative NCT library is used in this work for synthesis and optimization, where the Negative NCT library showed better quantum cost after optimization compared with the NCT library despite having the same circuit size. The reversible circuits over three bits form a permutation group of size 40,320 (23!), which Citation: Gado, M.; Younes, A.
    [Show full text]
  • Energy Recovery and Logical Reversibility in Adiabatic CMOS Multiplier
    Energy Recovery and Logical Reversibility in Adiabatic CMOS Multiplier Ismo Hänninen, Hao Lu, Craig S. Lent, Gregory L. Snider University of Notre Dame, Center for Nano Science and Technology, Notre Dame, IN 46556, USA {ismo.hanninen, hlu1, lent, snider.7}@nd.edu Abstract. Overcoming the IC power challenge requires signal energy recovery, which can be achieved utilizing adiabatic charging principles and logically reversible computing in the circuit design. This paper demonstrates the energy- efficiency of a Bennett-clocked adiabatic CMOS multiplier via a simulation model. The design is analyzed on the logic gate level to determine an estimate for the number of irreversible bit erasures occurring in a combinatorial implementation, showing considerable potential for minimizing the logical information loss. Keywords: Multipliers, computer arithmetic, adiabatic charging, reversible logic. 1 Introduction Reversible logic is a strict requirement for quantum computing, however, overcoming the power challenge of the traditional digital integrated circuits potentially benefits from the associated energy recovery enabled by the reversible computation principles. Standard Complementary Metal Oxide Semiconductor (CMOS) technology does not recover signal energy, which leads to considerable energy waste and heat dissipation, limiting the attainable device densities and operating frequencies, and thereby, also the available computing power. While the technology scales down, expected to follow the predictions of the International Roadmap for Semiconductors (ITRS), the loss of signal energy and limiting the related heat become all the more important factors for circuit design. [1] Adiabatically charged logic recovers part of the signal energy, and if the circuits are slowed down, asymptotically nearly all of the energy can be recovered.
    [Show full text]
  • Time, Space, and Energy in Reversible Computing
    Time, Space, and Energy in Reversible Computing Paul Vitan´ yi ¤ CWI University of Amsterdam National ICT of Australia ABSTRACT sipate energy by generating a corresponding amount of entropy for We survey results of a quarter century of work on computation by every bit of information that gets irreversibly erased; the logically reversible general-purpose computers (in this setting Turing ma- reversible operations can in principle be performed dissipation-free. chines), and general reversible simulation of irreversible computa- One should sharply distinguish between the issue of logical re- tions, with respect to energy-, time- and space requirements. versibility and the issue of energy dissipation freeness. If a com- Categories and Subject Descriptors: F.2 [Algorithms], F.1.3 puter operates in a logically reversible manner, then it still may dis- [Performance] sipate heat. For such a computer we know that the laws of physics General Terms: Algorithms, Performance do not preclude that one can invent a technology in which to im- plement a logically similar computer to operate physically in a dis- Keywords: Reversible computing, reversible simulation, adia- sipationless manner. Computers built from reversible circuits, or batic computing, low-energy computing, computational complex- the reversible Turing machine, [1, 2, 7], implemented with cur- ity, time complexity, space complexity, energy dissipation com- rent technology will presumably dissipate energy but may conceiv- plexity, tradeoffs. ably be implemented by future technology in an adiabatic fashion. But for logically irreversible computers adiabatic implementation 1. INTRODUCTION is widely considered impossible. Computer power has roughly doubled every 18 months for the Thought experiments can exhibit a computer that is both logi- last half-century (Moore’s law).
    [Show full text]
  • Chapter 2 Quantum Gates
    Chapter 2 Quantum Gates “When we get to the very, very small world—say circuits of seven atoms—we have a lot of new things that would happen that represent completely new opportunities for design. Atoms on a small scale behave like nothing on a large scale, for they satisfy the laws of quantum mechanics. So, as we go down and fiddle around with the atoms down there, we are working with different laws, and we can expect to do different things. We can manufacture in different ways. We can use, not just circuits, but some system involving the quantized energy levels, or the interactions of quantized spins.” – Richard P. Feynman1 Currently, the circuit model of a computer is the most useful abstraction of the computing process and is widely used in the computer industry in the design and construction of practical computing hardware. In the circuit model, computer scien- tists regard any computation as being equivalent to the action of a circuit built out of a handful of different types of Boolean logic gates acting on some binary (i.e., bit string) input. Each logic gate transforms its input bits into one or more output bits in some deterministic fashion according to the definition of the gate. By compos- ing the gates in a graph such that the outputs from earlier gates feed into the inputs of later gates, computer scientists can prove that any feasible computation can be performed. In this chapter we will look at the types of logic gates used within circuits and how the notions of logic gates need to be modified in the quantum context.
    [Show full text]
  • A Quantum of Thermodynamics
    Henrik Wilming A Quantum of Thermodynamics From ground state cooling to spontaneous symmetry breaking Im Fachbereich Physik der Freien Universität Berlin eingereichte Dissertation zur Erlangung des Grades eines Doktors der Naturwissenschaften. Berlin, 2017 Erstgutachter: Prof. Dr. Jens Eisert Zweitgutachter: Prof. Felix von Oppen, PhD Datum der Disputation: 19.7.2018 Publications of the author of this thesis Peer-reviewed publications: [1] H. Wilming, R. Gallego, and J. Eisert. “Second law of thermodynamics under con- trol restrictions”. Phys. Rev. E 93.4 (2016). DOI: 10.1103/physreve.93. 042126. [2] R. Gallego, J. Eisert, and H. Wilming. “Thermodynamic work from operational principles”. New J. Phys. 18.10 (2016), p. 103017. DOI: 10 . 1088 / 1367 - 2630/18/10/103017. [3] M. Perarnau-Llobet, A. Riera, R. Gallego, H. Wilming, and J. Eisert. “Work and entropy production in generalised Gibbs ensembles”. New J. Phys. 18.12 (2016), p. 123035. DOI: 10.1088/1367-2630/aa4fa6. [4] H. Wilming, M. J. Kastoryano, A. H. Werner, and J. Eisert. “Emergence of spon- taneous symmetry breaking in dissipative lattice systems”. J. Math. Phys. 58.3 (2017), p. 033302. DOI: 10.1063/1.4978328. [5] F. Pastawski, J. Eisert, and H. Wilming. “Towards Holography via Quantum Source- Channel Codes”. Phys. Rev. Lett. 119.2 (2017), p. 020501. DOI: 10 . 1103 / PhysRevLett.119.020501. [6] J Lekscha, H Wilming, J Eisert, and R Gallego. “Quantum thermodynamics with local control”. Phys. Rev. E 97.2 (2018), p. 022142. DOI: 10.1103/PhysRevE. 97.022142. arXiv: 10.1103/PhysRevD.97.086015. [7] H. Wilming, R. Gallego, and J. Eisert. “Axiomatic Characterization of the Quan- tum Relative Entropy and Free Energy”.
    [Show full text]
  • A Review on Reversible Computing and It's Applications on Combinational Circuits
    ISSN 2347 - 3983 Volume 9. No. 6, June 2021 Soham BhattacharyaInternational et al., International Journal Journal of of Emerging Emerging Trends Trends in Engineering in Engineering Research, 9(6), ResearchJune 2021, 80 6 – 814 Available Online at http://www.warse.org/IJETER/static/pdf/file/ijeter28962021.pdf https://doi.org/10.30534/ijeter/2021/2 8962021 A Review on Reversible Computing and it’s applications on combinational circuits Soham Bhattacharya1, Anindya Sen2 1,2Heritage Institute of Technology, Kolkata, West Bengal, India, Department of Electronics and Communication Engineering. [email protected] [email protected] ABSTRACT the question that why computers use most energy. From the Thermodynamics concept, he proposed that the amount of In this era of nanometer semiconductor nodes, the transistor energy dissipated for every irreversible bit operation is at scaling and voltage scaling are not any longer in line with least KTln2 joules, where, K denotes the Boltzmann’s each other, leading to the failure of the Dennard scaling. constant and T denotes the absolute temperature at which Thus, it poses a severe design challenge. Reversible operation is performed. This is known as the ‘Landauer computing plays a vital role in applications like low power Principle’. A circuit is alleged to be reversible if the input is recoverable from the output. Reversible computing holds up CMOS, nanotechnology, quantum computing, optical for each forward and backward movement method in concert computing, digital signal processing, cryptography, generates inputs from the outputs. The primitive combinable computer graphics and many more. The primary reasons for logic circuits scatter energy for all of data that's lost designing reversible logic are diminishing the quantum cost, throughout the activity.
    [Show full text]
  • Reversible Computing!
    The Future of Computing Depends on Making It Reversible It’s time to embrace reversible computing, which could offer dramatic improvements in energy efficiency Posted 25 Aug 2017 | 15:00 GMT By Michael P. Frank Illustration: Chad Hagen For more than 50 years, computers have made steady and dramatic improvements, all thanks to Moore’s Law—the exponential increase over time in the number of transistors that can be fabricated on an integrated circuit of a given size. Moore’s Law owed its success to the fact that as transistors were made smaller, they became simultaneously cheaper, faster, and more energy efficient. The payoff from this win-win-win scenario enabled reinvestment in semiconductor fabrication technology that could make even smaller, more densely packed transistors. And so this virtuous circle continued, decade after decade. Now though, experts in industry, academia, and government laboratories anticipate that semiconductor miniaturization won’t continue much longer—maybe 5 or 10 years. Making transistors smaller no longer yields the improvements it used to. The physical characteristics of small transistors caused clock speeds to stagnate more than a decade ago, which drove the industry to start building chips with multiple cores. But even multicore architectures must contend with increasing amounts of “dark silicon,” areas of the chip that must be powered off to avoid overheating. Heroic efforts are being made within the semiconductor industry to try to keep miniaturization going. But no amount of investment can change the laws of physics. At some point—now not very far away—a new computer that simply has smaller transistors will no longer be any cheaper, faster, or more energy efficient than its predecessors.
    [Show full text]
  • Reversible Computing
    Reversible Computing Quantum Computing’s Practical Cousin Michael P. Frank University of Florida Departments of CISE and ECE [email protected] Simons Conference Lecture Stony Brook, New York May 28-31, 2003 The title of this talk is meant to be a little bit provocative, given that this group mostly consists of quantum computing people... But, don’t get me wrong; I like quantum computing as much as the rest of you; I have been following the field with interest for about 8 years now. I do not mean to apply that quantum computing will never be practical for some applications. However, what I hope to convince you is that even without the quantum speedups, an area that is closely related to (but distinct from) QC, called Reversible Computing, will actually be even more useful than QC for the majority of real-world practical computing applications. 1 Abstract • “Mainstream” quantum computing is very difficult, and its currently known applications are quite limited. – Focus is on maintaining coherence of global superpositions. • Reversible computing is much easier, and its long-term practical applications are almost completely general. – Its benefits are provable from fundamental physics. • Well-engineered reversible computers might yield general, ≥1,000× cost-efficiency benefits by 2055. – We outline how this projection was obtained. • More attention should be paid to implementing self- contained, reversible, ballistic device mechanisms. – We give requirements, proof-of-concept examples. This is just a summary of the main points made in the already-announced abstract for the talk. The first observation is that mainstream quantum computing, which relies on maintaining coherence of global superposition states, is for this reason very difficult to achieve technologically.
    [Show full text]
  • Introduction to the Quantum Circuit Model September 9, 2015 Lecturer: Ryan O’Donnell Scribe: Ryan O’Donnell
    Quantum Computation (CMU 18-859BB, Fall 2015) Lecture 1: Introduction to the Quantum Circuit Model September 9, 2015 Lecturer: Ryan O'Donnell Scribe: Ryan O'Donnell 1 Overview of what is to come 1.1 An incredibly brief history of quantum computation The idea of quantum computation was pioneered in the 1980s mainly by Feynman [Fey82, Fey86] and Deutsch [Deu85, Deu89], with Albert [Alb83] independently introducing quantum automata and with Benioff [Ben80] analyzing the link between quantum mechanics and reversible classical computation. The initial idea of Feynman was the following: Although it is perfectly possible to use a (normal) computer to simulate the behavior of n-particle systems evolving according to the laws of quantum, it seems be extremely inefficient. In particular, it seems to take an amount of time/space that is exponential in n. This is peculiar because the actual particles can be viewed as simulating themselves efficiently. So why not call the particles themselves a \computer"? After all, although we have sophisticated theoretical models of (normal) computation, in the end computers are ultimately physical objects operating according to the laws of physics. If we simply regard the particles following their natural quantum-mechanical behavior as a computer, then this \quantum computer" appears to be performing a certain computation (namely, simulating a quantum system) exponentially more efficiently than we know how to perform it with a normal, \classical" computer. Perhaps we can carefully engineer multi-particle systems in such a way that their natural quantum behavior will do other interesting computations exponentially more efficiently than classical computers can.
    [Show full text]
  • A Simple Universal Logic Element and Cellular Automata for Reversible Computing
    A Simple Universal Logic Element and Cellular Automata for Reversible Computing Kenichi Morita Hiroshima University, Faculty of Engineering, Higashi-Hiroshima, 739-8527, Japan [email protected] http://www.ke.sys.hiroshima-u.ac.jp/˜morita Abstract. Reversible computing is a paradigm of computation that re- flects physical reversibility, and is considered to be important when de- signing a logical devices based on microscopic physical law in the near future. In this paper, we focus on a problem how universal computers can be built from primitive elements with very simple reversible rules. We introduce a new reversible logic element called a “rotary element”, and show that any reversible Turing machine can be realized as a circuit composed only of them. Such reversible circuits work in a very differ- ent fashion from conventional ones. We also discuss a simple reversible cellular automaton in which a rotary element can be implemented. 1 Introduction Recently, various computing models that directly reflect laws of Nature have been proposed and investigated. They are quantum computing (e.g., [2,4]), DNA computing (e.g., [11]), reversible computing (e.g., [1,2,3]), and so on. Reversible computing is a model reflecting physical reversibility, and has been known to play an important role when studying inevitable power dissipation in a computing process. Until now, several reversible systems such as reversible Turing machines, reversible cellular automata, and reversible logic circuits have been investigated. A logic gate is called reversible if its logical function is one-to-one. A reversible logic circuit is a one constructed only of reversible gates.
    [Show full text]
  • Symmetry Groups for the Decomposition of Reversible Computers, Quantum Computers, and Computers in Between
    Symmetry 2011, 3, 305-324; doi:10.3390/sym3020305 OPEN ACCESS symmetry ISSN 2073-8994 www.mdpi.com/journal/symmetry Article Symmetry Groups for the Decomposition of Reversible Computers, Quantum Computers, and Computers in between Alexis De Vos 1;? and Stijn De Baerdemacker 2 1 Department of Electronics and Information Systems, Universiteit Gent, Sint Pietersnieuwstraat 41, B-9000 Gent, Belgium 2 “FWO-Vlaanderen” post-doctoral fellow, Department of Physics and Astronomy, Universiteit Gent, Proeftuinstraat 86, B-9000 Gent, Belgium; E-Mail: [email protected] ? Author to whom correspondence should be addressed; E-Mail: [email protected]; Tel.: +32 9 264 33 76; Fax: +32 9 264 35 94 Received: 11 January 2011; in revised form: 24 May 2011 / Accepted: 27 May 2011 / Published: 7 June 2011 Abstract: Whereas quantum computing circuits follow the symmetries of the unitary Lie group, classical reversible computation circuits follow the symmetries of a finite group, i.e., the symmetric group. We confront the decomposition of an arbitrary classical reversible circuit with w bits and the decomposition of an arbitrary quantum circuit with w qubits. Both decompositions use the control gate as building block, i.e., a circuit transforming only one (qu)bit, the transformation being controlled by the other w − 1 (qu)bits. We explain why the former circuit can be decomposed into 2w − 1 control gates, whereas the latter circuit needs 2w − 1 control gates. We investigate whether computer circuits, not based on the full unitary group but instead on a subgroup of the unitary group, may be decomposable either into 2w − 1 or into 2w − 1 control gates.
    [Show full text]