A5080162494- Quantum Computing Algorithms and Architecture
- Quantum Information and Cryptography
- Quantum and electron transport phenomena
- Neural Networks and Reservoir Computing
- Cloud Computing and Resource Management
- Distributed and Parallel Computing Systems
- Parallel Computing and Optimization Techniques
- Quantum Mechanics and Applications
- Stochastic Gradient Optimization Techniques
IBM (United States)
2020-2024
IBM Research - Thomas J. Watson Research Center
2023
Abstract We improve the quality of quantum circuits on superconducting computing systems, as measured by volume (QV), with a combination dynamical decoupling, compiler optimizations, shorter two-qubit gates, and excited state promoted readout. This result shows that path to larger QV systems requires simultaneous increase coherence, control gate fidelities, measurement smarter software which takes into account hardware details, thereby demonstrating need continue co-design stack for...
We describe Qiskit, a software development kit for quantum information science. discuss the key design decisions that have shaped its development, and examine architecture core components. demonstrate an end-to-end workflow solving problem in condensed matter physics on computer serves to highlight some of Qiskit's capabilities, example representation optimization circuits at various abstraction levels, scalability retargetability new gates, use quantum-classical computations via dynamic...
We improve the quality of quantum circuits on superconducting computing systems, as measured by volume, with a combination dynamical decoupling, compiler optimizations, shorter two-qubit gates, and excited state promoted readout. This result shows that path to larger volume systems requires simultaneous increase coherence, control gate fidelities, measurement smarter software which takes into account hardware details, thereby demonstrating need continue co-design stack for foreseeable future.
Practical distributed quantum computing requires the development of efficient compilers, able to make circuits compatible with some given hardware constraints. This problem is known be tough, even for local computing. Here, we address it on architectures. As generally assumed in this scenario, telegates represent fundamental remote (inter-processor) operations. Each telegate consists several tasks: i) entanglement generation and distribution, ii) operations, iii) classical communications....
Many proposals to scale quantum technology rely on modular or distributed designs where individual processors, called nodes, are linked together form one large multinode computer (MNQC). One scalable method construct an MNQC is using superconducting systems with optical interconnects. However, a limiting factor of these machines will be internode gates, which may two three orders magnitude noisier and slower than local operations. Surmounting the limitations gates require range techniques,...
Many proposals to scale quantum technology rely on modular or distributed designs wherein individual processors, called nodes, are linked together form one large multinode computer (MNQC). One scalable method construct an MNQC is using superconducting systems with optical interconnects. However, internode gates in these may be two three orders of magnitude noisier and slower than local operations. Surmounting the limitations will require improvements entanglement generation, use...
Quantum measurement is important to quantum computing as it extracts out the outcome of circuit at end computation. Previously, all measurements have be done circuit. Otherwise, will incur significant errors. But not case now. Recently IBM starts supporting dynamic through hardware (instead software by simulator). With mid-circuit measurement, we can improve efficacy and fidelity from three aspects: (a) reduced qubit usage, (b) swap insertion, (c) improved fidelity. We demonstrate this using...
A limited number of qubits, high error rates, and qubit connectivity are major challenges for effective near-term quantum computations. Quantum circuit partitioning divides a computation into classical postprocessing steps set smaller-scale computations that individually require fewer lower connectivity, typically incur less error. However, as generally increases the duration exponentially in required effort, it is crucial to select optimal points, so-called cuts, use cut realizations. In...
Practical distributed quantum computing requires the development of efficient compilers, able to make circuits compatible with some given hardware constraints. This problem is known be tough, even for local computing. Here, we address it on architectures. As generally assumed in this scenario, telegates represent fundamental remote (inter-processor) operations. Each telegate consists several tasks: i) entanglement generation and distribution, ii) operations, iii) classical communications....
Coherent errors, and especially those that occur in correlation among a set of qubits, are detrimental for large-scale quantum computing. Correlations noise can as result spatial temporal configurations instructions executing on the processor. In this paper, we perform detailed experimental characterization many these error sources, theoretically connect them to physics superconducting qubits gate operations. Equipped with knowledge, devise compiler strategies suppress errors using dynamical...
Near-term quantum computations are limited by high error rates, the scarcity of qubits and low qubit connectivity. Increasing support for mid-circuit measurements reset in near-term computers enables reuse that may yield with fewer lower errors. In this work, we introduce a formal model optimization delivers provably optimal solutions respect to circuit depth, number qubits, or swap gates first time. This is contrast related work where used heuristically optimally but without consideration...
Near-term quantum computations are limited by high error rates, the scarcity of qubits and low qubit connectivity. Increasing support for mid-circuit measurements reset in near-term computers enables reuse that may yield with fewer lower errors. In this work, we introduce a formal model optimization delivers provably optimal solutions respect to circuit depth, number qubits, or swap gates first time. This is contrast related work where used heuristically optimally but without consideration...
A limited number of qubits, high error rates, and qubit connectivity are major challenges for effective near-term quantum computations. Quantum circuit partitioning divides a computation into set computations that include smaller-scale (sub)circuits classical postprocessing steps. These subcircuits require fewer incur smaller effort satisfying requirements, typically less error. Thus, has the potential to enable would otherwise only be available on more matured hardware. However, circuits...