A5028606846- Quantum Computing Algorithms and Architecture
- Quantum Information and Cryptography
- Cloud Computing and Resource Management
- Parallel Computing and Optimization Techniques
- Distributed and Parallel Computing Systems
- Advancements in Semiconductor Devices and Circuit Design
- Quantum and electron transport phenomena
- Manufacturing Process and Optimization
- Semiconductor materials and devices
- Quantum-Dot Cellular Automata
Cambridge Quantum Computing (United Kingdom)
2020-2022
We present t$|$ket$\rangle$, a quantum software development platform produced by Cambridge Quantum Computing Ltd. The heart of t$|$ket$\rangle$ is language-agnostic optimising compiler designed to generate code for variety NISQ devices, which has several features minimise the influence device error. been extensively benchmarked and outperforms most competitors in terms circuit optimisation qubit routing.
We give an overview of the circuit optimisation methods used by tket, a compiler system for quantum software developed Cambridge Quantum Computing Ltd. focus on novel technique based around phase gadgets, family multi-qubit operations which occur naturally in wide range circuits practical interest. The gadgets have simple presentation ZX-calculus, makes it easy to reason about them. Taking advantage this, we present efficient method translate back CNOT gates and single qubit suitable...
Quantum computing systems need to be benchmarked in terms of practical tasks they would expected do. Here, we propose 3 "application-motivated" circuit classes for benchmarking: deep (relevant state preparation the variational quantum eigensolver algorithm), shallow (inspired by IQP-type circuits that might useful near-term machine learning), and square volume benchmark). We quantify performance a system running from these using several figures merit, all which require exponential classical...
The detrimental effect of noise accumulates as quantum computers grow in size. In the case where devices are too small or noisy to perform error correction, mitigation may be used. Error does not increase fidelity states, but instead aims reduce approximation quantities concern, such expectation values observables. However, it is yet unclear which circuit types, and characteristics, benefit most from use mitigation. Here we develop a methodology assess performance techniques. Our benchmarks...
We introduce a new architecture-agnostic methodology for mapping abstract quantum circuits to realistic computing devices with restricted qubit connectivity, as implemented by Cambridge Quantum Computing's tket compiler. present empirical results showing the effectiveness of this method in terms reducing two-qubit gate depth and count, compared other implementations.
We present Tierkreis, a higher-order dataflow graph program representation and runtime designed for compositional, quantum-classical hybrid algorithms. The design of the system is motivated by remote nature quantum computers, need algorithms to involve cloud distributed computing, long-running these graph-based reflects how designers reason about visualise algorithms, allows automatic parallelism asynchronicity. A strong, static type semantics allow high expressivity compositionality in...
The detrimental effect of noise accumulates as quantum computers grow in size. In the case where devices are too small or noisy to perform error correction, mitigation may be used. Error does not increase fidelity states, but instead aims reduce approximation quantities concern, such expectation values observables. However, it is yet unclear which circuit types, and characteristics, benefit most from use mitigation. Here we develop a methodology assess performance techniques. Our benchmarks...
We present Tierkreis, a higher-order dataflow graph program representation and runtime designed for compositional, quantum-classical hybrid algorithms. The design of the system is motivated by remote nature quantum computers, need algorithms to involve cloud distributed computing, long-running these graph-based reflects how designers reason about visualise algorithms, allows automatic parallelism asynchronicity. A strong, static type semantics allow high expressivity compositionality in...