Catalogue Search | MBRL
Are you sure you want to remove the book from the shelf?
{{itemTitle}}
178,374
result(s) for
"PROCESSORS"
Sort by:
Chip war : the fight for the world's most critical technology
\"An epic account of the decades-long battle to control what has emerged as the world's most critical resource--microchip technology--with the United States and China increasingly in conflict. You may be surprised to learn that microchips are the new oil--the scarce resource on which the modern world depends. Today, military, economic, and geopolitical power are built on a foundation of computer chips. Virtually everything--from missiles to microwaves, smartphones to the stock market--runs on chips. Until recently, America designed and built the fastest chips and maintained its lead as the #1 superpower. Now, America's edge is slipping, undermined by competitors in Taiwan, Korea, Europe, and, above all, China. Today, as Chip War reveals, China, which spends more money each year importing chips than it spends importing oil, is pouring billions into a chip-building initiative to catch up to the US. At stake is America's military superiority and economic prosperity. Economic historian Chris Miller explains how the semiconductor came to play a critical role in modern life and how the U.S. become dominant in chip design and manufacturing and applied this technology to military systems. America's victory in the Cold War and its global military dominance stems from its ability to harness computing power more effectively than any other power. But here, too, China is catching up, with its chip-building ambitions and military modernization going hand in hand. America has let key components of the chip-building process slip out of its grasp, contributing not only to a worldwide chip shortage but also a new Cold War with a superpower adversary that is desperate to bridge the gap. Illuminating, timely, and fascinating, Chip War shows that, to make sense of the current state of politics, economics, and technology, we must first understand the vital role played by chips\"--Amazon.
Book
A Methodology for the Synthesis of E-Commerce
Recent advances in real-time communication and relational modalities offer a viable alternative to the producer-consumer problem. After years of theoretical research into the partition table, we show the refinement of the location-identity split, which embodies the robust principles of operating sys-tems. In order to fix this issue, we propose new scalable archetypes (Gunnel), demonstrating that multi-processors and multi-processors are never incompatible.
Journal Article
Topological analog signal processing
Analog signal processors have attracted a tremendous amount of attention recently, as they potentially offer much faster operation and lower power consumption than their digital versions. Yet, they are not preferable for large scale applications due to the considerable observational errors caused by their excessive sensitivity to environmental and structural variations. Here, we demonstrate both theoretically and experimentally the unique relevance of topological insulators for alleviating the unreliability of analog signal processors. In particular, we achieve an important signal processing task, namely resolution of linear differential equations, in an analog system that is protected by topology against large levels of disorder and geometrical perturbations. We believe that our strategy opens up large perspectives for a new generation of robust all-optical analog signal processors, which can now not only perform ultrafast, high-throughput, and power efficient signal processing tasks, but also compete with their digital counterparts in terms of reliability and flexibility.
Analog signal processors could potentially offer faster operation and lower power consumption than digital versions, but are not yet commonly used for large scale applications due to considerable observational errors. Here, the authors demonstrate the unique relevance of topological insulators for improving reliability in such analog processors.
Journal Article
Efficient Variational Quantum Simulator Incorporating Active Error Minimization
One of the key applications for quantum computers will be the simulation of other quantum systems that arise in chemistry, materials science, etc., in order to accelerate the process of discovery. It is important to ask the following question: Can this simulation be achieved using near-future quantum processors, of modest size and under imperfect control, or must it await the more distant era of large-scale fault-tolerant quantum computing? Here, we propose a variational method involving closely integrated classical and quantum coprocessors. We presume that all operations in the quantum coprocessor are prone to error. The impact of such errors is minimized by boosting them artificially and then extrapolating to the zero-error case. In comparison to a more conventional optimized Trotterization technique, we find that our protocol is efficient and appears to be fundamentally more robust against error accumulation.
Journal Article
Quantum Information Scrambling on a Superconducting Qutrit Processor
The dynamics of quantum information in strongly interacting systems, known as quantum information scrambling, has recently become a common thread in our understanding of black holes, transport in exotic non-Fermi liquids, and many-body analogs of quantum chaos. To date, verified experimental implementations of scrambling have focused on systems composed of two-level qubits. Higher-dimensional quantum systems, however, may exhibit different scrambling modalities and are predicted to saturate conjectured speed limits on the rate of quantum information scrambling. We take the first steps toward accessing such phenomena, by realizing a quantum processor based on superconducting qutrits (three-level quantum systems). We demonstrate the implementation of universal two-qutrit scrambling operations and embed them in a five-qutrit quantum teleportation protocol. Measured teleportation fidelitiesFavg=0.568±0.001confirm the presence of scrambling even in the presence of experimental imperfections and decoherence. Our teleportation protocol, which connects to recent proposals for studying traversable wormholes in the laboratory, demonstrates how quantum technology that encodes information in higher-dimensional systems can exploit a larger and more connected state space to achieve the resource efficient encoding of complex quantum circuits.
Journal Article
Non-Abelian braiding of graph vertices in a superconducting processor
Indistinguishability of particles is a fundamental principle of quantum mechanics
1
. For all elementary and quasiparticles observed to date—including fermions, bosons and Abelian anyons—this principle guarantees that the braiding of identical particles leaves the system unchanged
2
,
3
. However, in two spatial dimensions, an intriguing possibility exists: braiding of non-Abelian anyons causes rotations in a space of topologically degenerate wavefunctions
4
–
8
. Hence, it can change the observables of the system without violating the principle of indistinguishability. Despite the well-developed mathematical description of non-Abelian anyons and numerous theoretical proposals
9
–
22
, the experimental observation of their exchange statistics has remained elusive for decades. Controllable many-body quantum states generated on quantum processors offer another path for exploring these fundamental phenomena. Whereas efforts on conventional solid-state platforms typically involve Hamiltonian dynamics of quasiparticles, superconducting quantum processors allow for directly manipulating the many-body wavefunction by means of unitary gates. Building on predictions that stabilizer codes can host projective non-Abelian Ising anyons
9
,
10
, we implement a generalized stabilizer code and unitary protocol
23
to create and braid them. This allows us to experimentally verify the fusion rules of the anyons and braid them to realize their statistics. We then study the prospect of using the anyons for quantum computation and use braiding to create an entangled state of anyons encoding three logical qubits. Our work provides new insights about non-Abelian braiding and, through the future inclusion of error correction to achieve topological protection, could open a path towards fault-tolerant quantum computing.
A unitary protocol for braiding projective non-Abelian Ising anyons in a generalized stabilizer code is implemented on a superconducting processor, allowing for verification of their fusion rules and realization of their exchange statistics.
Journal Article
Measuring the capabilities of quantum computers
Quantum computers can now run interesting programs, but each processor’s capability—the set of programs that it can run successfully—is limited by hardware errors. These errors can be complicated, making it difficult to accurately predict a processor’s capability. Benchmarks can be used to measure capability directly, but current benchmarks have limited flexibility and scale poorly to many-qubit processors. We show how to construct scalable, efficiently verifiable benchmarks based on any program by using a technique that we call circuit mirroring. With it, we construct two flexible, scalable volumetric benchmarks based on randomized and periodically ordered programs. We use these benchmarks to map out the capabilities of twelve publicly available processors, and to measure the impact of program structure on each one. We find that standard error metrics are poor predictors of whether a program will run successfully on today’s hardware, and that current processors vary widely in their sensitivity to program structure.
Evaluations of quantum computers across architectures need reliable benchmarks. A class of benchmarks that can directly reflect the structure of any algorithm shows that different quantum computers have considerable variations in performance.
Journal Article
What is the Computational Value of Finite-Range Tunneling?
Quantum annealing (QA) has been proposed as a quantum enhanced optimization heuristic exploiting tunneling. Here, we demonstrate how finite-range tunneling can provide considerable computational advantage. For a crafted problem designed to have tall and narrow energy barriers separating local minima, the D-Wave 2X quantum annealer achieves significant runtime advantages relative to simulated annealing (SA). For instances with 945 variables, this results in a time-to-99%-success-probability that is ∼108 times faster than SA running on a single processor core. We also compare physical QA with the quantum Monte Carlo algorithm, an algorithm that emulates quantum tunneling on classical processors. We observe a substantial constant overhead against physical QA: D-Wave 2X again runs up to ∼108 times faster than an optimized implementation of the quantum Monte Carlo algorithm on a single core. We note that there exist heuristic classical algorithms that can solve most instances of Chimera structured problems in a time scale comparable to the D-Wave 2X. However, it is well known that such solvers will become ineffective for sufficiently dense connectivity graphs. To investigate whether finite-range tunneling will also confer an advantage for problems of practical interest, we conduct numerical studies on binary optimization problems that cannot yet be represented on quantum hardware. For random instances of the number partitioning problem, we find numerically that algorithms designed to simulate QA scale better than SA. We discuss the implications of these findings for the design of next-generation quantum annealers.
Journal Article
Computation of Molecular Spectra on a Quantum Processor with an Error-Resilient Algorithm
Harnessing the full power of nascent quantum processors requires the efficient management of a limited number of quantum bits with finite coherent lifetimes. Hybrid algorithms, such as the variational quantum eigensolver (VQE), leverage classical resources to reduce the required number of quantum gates. Experimental demonstrations of VQE have resulted in calculation of Hamiltonian ground states, and a new theoretical approach based on a quantum subspace expansion (QSE) has outlined a procedure for determining excited states that are central to dynamical processes. We use a superconducting-qubit-based processor to apply the QSE approach to theH2molecule, extracting both ground and excited states without the need for auxiliary qubits or additional minimization. Further, we show that this extended protocol can mitigate the effects of incoherent errors, potentially enabling larger-scale quantum simulations without the need for complex error-correction techniques.
Journal Article