17 hasil untuk "Rodney Van Meter"
Menampilkan 1–17 · 0,29 detik · RSS
-
Artikel Jurnal
Editorial Scaling Up Quantum Systems: Engineers Wanted!
I just finished reading Kathy Kleiman's fantastic book, Proving Ground, about the ENIAC 6: the six women who were the first team dedicated to programming the world's first fully programmable, digital, electronic computer. The parallels between the earliest digital computers and the state of today's…
-
Artikel Jurnal
Testing and Debugging Quantum Circuits
This article introduces a process framework for debugging quantum circuits, focusing on three distinct types of circuit blocks: amplitude–permutation, phase-modulation, and amplitude–redistribution circuit blocks. Our research addresses the critical need for specialized debugging approaches…
-
Artikel Jurnal
Bridging All-Photonic and Memory-Based Quantum Repeaters
The all-photonic quantum repeater scheme based on repeater graph states (RGSs) offers a promising approach for constructing quantum networks without relying on long-coherence-time quantum memories, which remain a significant technological challenge. Despite substantial progress in defining new…
-
Artikel Jurnal
Subdivided Phase Oracle for NISQ Search Algorithms
Because noisy intermediate-scale quantum (NISQ) machines accumulate errors quickly, we need new approaches to designing NISQ-aware algorithms and assessing their performance. Algorithms with characteristics that appear less desirable under ideal circumstances, such as lower success probability, may…
-
Artikel Jurnal
Simultaneous Execution of Quantum Circuits on Current and Near-Future NISQ Systems
In the noisy intermediate-scale quantum (NISQ) era, the idea of quantum multiprogramming, running multiple quantum circuits (QCs) simultaneously on the same hardware, helps to improve the throughput of quantum computation. However, the crosstalk, unwanted interference between qubits on NISQ…
-
Artikel Jurnal
Finding Small and Large $k$-Clique Instances on a Quantum Computer
Algorithms for triangle finding, the smallest nontrivial instance of the k-clique problem, have been proposed for quantum computers. Still, those algorithms assume the use of fixed access time quantum RAM. In this article, we present a practical gate-based approach to both the triangle-finding…
-
Artikel Jurnal
Graybox characterization and calibration with finite-shot estimation on superconducting-qubit experiments
Characterization and calibration of quantum devices are necessary steps to achieve fault-tolerant quantum computing. As quantum devices become more sophisticated, it is increasingly essential to rely not only on physics-based models but also on machine learning models with open-loop optimization…
-
Artikel Jurnal Teks lengkap
When Entanglement Meets Classical Communications: Quantum Teleportation for the Quantum Internet
Quantum Teleportation is the key communication functionality of the Quantum Internet, allowing the “transmission” of qubits without the physical transfer of the particle storing the qubit. Quantum teleportation is facilitated by the action of quantum entanglement, a somewhat counter-intuitive…
-
Artikel Jurnal
Surface code quantum computing by lattice surgery
In recent years, surface codes have become a leading method for quantum error correction in theoretical large-scale computational and communications architecture designs. Their comparatively high fault-tolerant thresholds and their natural two-dimensional nearest-neighbour (2DNN) structure make…
-
Artikel Jurnal
Surface code error correction on a defective lattice
The yield of physical qubits fabricated in the laboratory is much lower than that of classical transistors in production semiconductor fabrication. Actual implementations of quantum computers will be susceptible to loss in the form of physically faulty qubits. Though these physical faults must…
-
Artikel Jurnal
Attacking the Quantum Internet
The main service provided by the coming quantum Internet will be creating entanglement between any two quantum nodes. We discuss and classify attacks on quantum repeaters, which will serve roles similar to those of classical Internet routers. We have modeled the components for and structure of…
-
Artikel Jurnal
Efficient Construction of a Control Modular Adder on a Carry-Lookahead Adder Using Relative-Phase Toffoli Gates
…computers (NISQ). We give a more efficient construction compared with Van Meter and Itoh’s, based on a carry-lookahead adder. In FTQ, $T$ gates incur heavy cost due to distillation, which fabricates ancilla for running $T$ gates with high accuracy but consumes a lot of especially prepared ancilla…
-
Artikel Jurnal
The Present and Future of Discrete Logarithm Problems on Noisy Quantum Computers
The discrete logarithm problem (DLP) is the basis for several cryptographic primitives. Since Shor’s work, it has been known that the DLP can be solved by combining a polynomial-size quantum circuit and a polynomial-time classical postprocessing algorithm. The theoretical result corresponds the…
-
Artikel Jurnal
Corrections to “The Present and Future of Discrete Logarithm Problems on Noisy Quantum Computers” [2022 doi: 10.1109/TQE.2022.3183385]
Presents corrections to the article “The Present and Future of Discrete Logarithm Problems on Noisy Quantum Computers”.
-
Artikel Jurnal
Disti-Mator, an entanglement distillation-based state estimator
Abstract Minimizing both experimental effort and consumption of valuable quantum resources in state estimation is vital in practical quantum information processing. Typically, estimation protocols are independently implemented from other protocols, incurring additional resource cost. Here, we…
-
Artikel Jurnal
Layered Architecture for Quantum Computing
We develop a layered quantum-computer architecture, which is a systematic framework for tackling the individual challenges of developing a quantum computer while constructing a cohesive device design. We discuss many of the prominent techniques for implementing circuit-model quantum computing and…
-
Artikel Jurnal
Faster quantum chemistry simulation on fault-tolerant quantum computers
Quantum computers can in principle simulate quantum physics exponentially faster than their classical counterparts, but some technical hurdles remain. We propose methods which substantially improve the performance of a particular form of simulation, ab initio quantum chemistry, on fault-tolerant…