Quantum Random Access Memory (QRAM) has the potential to revolutionize the area of quantum computing. QRAM uses quantum computing principles to store and modify quantum or classical data efficiently, greatly accelerating a wide range of computer processes. Despite its importance, there is a lack of comprehensive surveys that cover the entire spectrum of QRAM architectures. We fill this gap by providing a comprehensive review of QRAM, emphasizing its significance and viability in existing noisy quantum computers. By drawing comparisons with conventional RAM for ease of understanding, this survey clarifies the fundamental ideas and actions of QRAM. QRAM provides an exponential time advantage compared to its classical counterpart by reading and writing all data at once, which is achieved owing to storage of data in a superposition of states. Overall, we compare six different QRAM technologies in terms of their structure and workings, circuit width and depth, unique qualities, practical implementation, and drawbacks. In general, with the exception of trainable machine learning-based QRAMs, we observe that QRAM has exponential depth/width requirements in terms of the number of qubits/qudits and that most QRAM implementations are practical for superconducting and trapped-ion qubit systems.
4 April 2025 in IEEE Transactions on Quantum Engineering
Quantum Hamiltonian simulation is one of the most promising applications of quantum computing and forms the basis for many quantum algorithms. Benchmarking them is an important gauge of progress in quantum computing technology. We present a methodology and software framework to evaluate various facets of the performance of gate-based quantum computers on Trotterized quantum Hamiltonian evolution. We propose three distinct modes for benchmarking: (i) comparing simulation on a real device to that on a noiseless classical simulator, (ii) comparing simulation on a real device with exact diagonalization results, and (iii) using scalable mirror circuit techniques to assess hardware performance in scenarios beyond classical simulation methods. We demonstrate this framework on five Hamiltonian models from the HamLib library: the Fermi and Bose-Hubbard models, the transverse field Ising model, the Heisenberg model, and the Max3SAT problem. Experiments were conducted using Qiskit's Aer simulator, BlueQubit's CPU cluster and GPU simulators, and IBM's quantum hardware. Our framework, extendable to other Hamiltonians, provides comprehensive performance profiles that reveal hardware and algorithmic limitations and measure both fidelity and execution times, identifying crossover points where quantum hardware outperforms CPU/GPU simulators.
Quantum computing, with its transformative computational potential, is gaining prominence in the technological landscape. As a new and exotic technology, quantum computers involve innumerable Intellectual Property (IP) in the form of fabrication recipe, control electronics and software techniques, to name a few. Furthermore, complexity of quantum systems necessitates extensive involvement of third party tools, equipment and services which could risk the IPs and the Quality of Service and enable other attack surfaces. This paper is a first attempt to explore the quantum computing ecosystem, from the fabrication of quantum processors to the development of specialized software tools and hardware components, from a security perspective. By investigating the publicly disclosed information from industry front runners like IBM, Google, Honeywell and more, we piece together various components of quantum computing supply chain. We also uncover some potential vulnerabilities and attack models and suggest defenses. We highlight the need to scrutinize the quantum computing supply chain further through the lens of security.
Quantum error correction codes (QECCs) are essential for reliable quantum computing as they protect quantum states against noise and errors. Limited research has explored the resilience of QECCs to biased noise, critical for selecting optimal codes. We examine how different noise types impact QECCs, considering the varying susceptibility of quantum systems to specific errors. Our goal is to identify opportunities to minimize the resources—or overhead—needed for effective error correction. We conduct a detailed study on two QECCs—rotated and unrotated surface codes—under various noise models using simulations. Rotated surface codes generally perform better due to their simplicity and lower qubit overhead. They exceed the noise threshold of current quantum processors, making them more effective at lower error rates. This study highlights a hierarchy in surface code implementation based on resource demand, consistently observed across both code types. Our analysis ranks the code-capacity model as the most pessimistic and the circuit-level model as the most realistic, mapping error thresholds that show surface code advantages. Additionally, higher code distances improve performance without excessively increasing qubit overhead. Tailoring surface codes to align with the target logical error rate and the biased physical error profile is crucial for optimizing reliability and resource use.
Quantum error correction (QEC) plays a crucial role in correcting noise and paving the way for fault-tolerant quantum computing. This field has seen significant advancements, with new quantum error correction codes emerging regularly to address errors effectively. Among these, topological codes, particularly surface codes, stand out for their low error thresholds and feasibility for implementation in large-scale quantum computers. However, these codes are restricted to encoding a single qubit. Lattice surgery is crucial for enabling interactions among multiple encoded qubits or between the lattices of a surface code, ensuring that its sophisticated error-correcting features are maintained without significantly increasing the operational overhead. Lattice surgery is pivotal for scaling QECCs across more extensive quantum systems. Despite its critical importance, comprehending lattice surgery is challenging due to its inherent complexity, demanding a deep understanding of intricate quantum physics and mathematical concepts. This paper endeavors to demystify lattice surgery, making it accessible to those without a profound background in quantum physics or mathematics. This work explores surface codes, introduces the basics of lattice surgery, and demonstrates its application in building quantum gates and emulating multi-qubit circuits.
In the evolving field of quantum computing, optimizing Quantum Error Correction (QEC) parameters is crucial due to the varying types and amounts of physical noise across quantum computers. Traditional simulators use a forward paradigm to derive logical error rates from inputs like code distance and rounds, but this can lead to resource wastage. Adjusting QEC parameters manually with tools like STIM is often inefficient, especially given the daily fluctuations in quantum error rates. To address this, we introduce MITS, a reverse engineering tool for STIM that automatically determines optimal QEC settings based on a given quantum computer’s noise model and a target logical error rate. This approach minimizes qubit and gate usage by precisely matching the necessary logical error rate with the constraints of qubit numbers and gate fidelity. Our investigations into various heuristics and machine learning models for MITS show that XGBoost and Random Forest regressions, with Pearson correlation coefficients of and , respectively, are highly effective in this context.