38 citations · 65 across the 9 of their papers we have counts for
9 papers · 1 filter
Pulse-optimised circuit elements for scalable and noise-resilient quantum chemistry
Henrik Gothen, Christopher K. Long, Djamila Hiller +4
Useful chemistry calculations on near-term quantum processors are hindered by current algorithmic runtimes. We develop a methodology to significantly reduce these runtimes. Typical…
Hardware-Tailored Resource Estimation for Magic-State Distillation on Silicon Spin Qubits
Songqinghao Yang, Christopher K. Long, Rubén M. Otxoa +3
We present a resource analysis for generating high-fidelity logical magic states on silicon spin-qubit platforms. We consider a range of architectures, including a shuttling-based…
From virtual Z gates to virtual Z pulses
Christopher K. Long, Crispin H. W. Barnes
Virtual gates have become integral for implementing fast, high-fidelity single-qubit operations. However, virtual gates require that the system's two-qubit gates are microw…
Quantifying the advantages of applying quantum approximate algorithms to portfolio optimisation
Haomu Yuan, Christopher K. Long, Hugo V. Lepage +1
We present a quantum algorithm for portfolio optimisation. Specifically, We present san end-to-end quantum approximate optimisation algorithm to solve the discrete global minimum v…
Minimal evolution times for fast, pulse-based state preparation in silicon spin qubits
Christopher K. Long, Nicholas J. Mayhall, Sophia E. Economou +5
Standing as one of the most significant barriers to reaching quantum advantage, state-preparation fidelities on noisy intermediate-scale quantum processors suffer from quantum-gate…
Almost no experiments have classical Kirkwood-Dirac representations
Christopher Langrenez, Wilfred Salmon, Stephan De Bièvre +3
A central problem in quantum information is determining quantum-classical boundaries. In the quasiprobability framework, a state is called classical if it is represented by a quasi…
Dynamic-ADAPT-QAOA: An algorithm with shallow and noise-resilient circuits
Nikola Yanakiev, Normann Mertig, Christopher K. Long +1
The quantum approximate optimization algorithm (QAOA) is an appealing proposal to solve NP problems on noisy intermediate-scale quantum (NISQ) hardware. Making NISQ implementations…
Layering and subpool exploration for adaptive Variational Quantum Eigensolvers: Reducing circuit depth, runtime, and susceptibility to noise
Christopher K. Long, Kieran Dalton, Crispin H. W. Barnes +2
Adaptive variational quantum eigensolvers (ADAPT-VQEs) are promising candidates for simulations of strongly correlated systems on near-term quantum hardware. To further improve the…
Quantifying the effect of gate errors on variational quantum eigensolvers for quantum chemistry
Kieran Dalton, Christopher K. Long, Yordan S. Yordanov +4
Variational quantum eigensolvers (VQEs) are leading candidates to demonstrate near-term quantum advantage. Here, we conduct density-matrix simulations of leading gate-based VQEs fo…