t| ket⟩: a retargetable compiler for NISQ devices
We present t| ket⟩, a quantum software development platform produced by Cambridge
Quantum Computing Ltd. The heart of t| ket⟩ is a language-agnostic optimising compiler …
Quantum Computing Ltd. The heart of t| ket⟩ is a language-agnostic optimising compiler …
Scalable circuits for preparing ground states on digital quantum computers: The Schwinger model vacuum on 100 qubits
The vacuum of the lattice Schwinger model is prepared on up to 100 qubits of IBM's Eagle-
processor quantum computers. A new algorithm to prepare the ground state of a gapped …
processor quantum computers. A new algorithm to prepare the ground state of a gapped …
ZX-calculus for the working quantum computer scientist
J van de Wetering - arxiv preprint arxiv:2012.13966, 2020 - arxiv.org
The ZX-calculus is a graphical language for reasoning about quantum computation that has
recently seen an increased usage in a variety of areas such as quantum circuit optimisation …
recently seen an increased usage in a variety of areas such as quantum circuit optimisation …
[HTML][HTML] Analyzing the barren plateau phenomenon in training quantum neural networks with the ZX-calculus
In this paper, we propose a general scheme to analyze the gradient vanishing phenomenon,
also known as the barren plateau phenomenon, in training quantum neural networks with …
also known as the barren plateau phenomenon, in training quantum neural networks with …
A quantum-classical cloud platform optimized for variational hybrid algorithms
In order to support near-term applications of quantum computing, a new compute paradigm
has emerged—the quantum-classical cloud—in which quantum computers (QPUs) work in …
has emerged—the quantum-classical cloud—in which quantum computers (QPUs) work in …
Paulihedral: a generalized block-wise compiler optimization framework for quantum simulation kernels
The quantum simulation kernel is an important subroutine appearing as a very long gate
sequence in many quantum programs. In this paper, we propose Paulihedral, a block-wise …
sequence in many quantum programs. In this paper, we propose Paulihedral, a block-wise …
There and back again: A circuit extraction tale
Translations between the quantum circuit model and the measurement-based one-way
model are useful for verification and optimisation of quantum computations. They make …
model are useful for verification and optimisation of quantum computations. They make …
Qfast: Conflating search and numerical optimization for scalable quantum circuit synthesis
We present a topology aware quantum synthesis algorithm designed to produce short
circuits and to scale well in practice. The main contribution is a novel representation of …
circuits and to scale well in practice. The main contribution is a novel representation of …
Simulating quantum circuits with ZX-calculus reduced stabiliser decompositions
We introduce an enhanced technique for strong classical simulation of quantum circuits
which combines the'sum-of-stabilisers' method with an automated simplification strategy …
which combines the'sum-of-stabilisers' method with an automated simplification strategy …
Optimal joint cutting of two-qubit rotation gates
Circuit cutting, the partitioning of quantum circuits into smaller independent fragments, has
become a promising avenue for scaling up current quantum-computing experiments. Here …
become a promising avenue for scaling up current quantum-computing experiments. Here …