Skip to main content

Research Repository

Advanced Search

Outputs (4)

Graphical structures for design and verification of quantum error correction (2023)
Journal Article
Chancellor, N., Kissinger, A., Zohren, S., Roffe, J., & Horsman, D. (2023). Graphical structures for design and verification of quantum error correction. Quantum Science and Technology, 8(4), Article 045028. https://doi.org/10.1088/2058-9565/acf157

We introduce a high-level graphical framework for designing and analysing quantum error correcting codes, centred on what we term the coherent parity check (CPC). The graphical formulation is based on the diagrammatic tools of the ZX-calculus of quan... Read More about Graphical structures for design and verification of quantum error correction.

Using copies can improve precision in continuous-time quantum computing (2023)
Journal Article
Bennett, J., Callison, A., O’Leary, T., West, M., Chancellor, N., & Kendon, V. (2023). Using copies can improve precision in continuous-time quantum computing. Quantum Science and Technology, 8(3), Article 035031. https://doi.org/10.1088/2058-9565/acdcb5

In the quantum optimisation setting, we build on a scheme introduced by Young et al (2013 Phys. Rev. A 88 062314), where physical qubits in multiple copies of a problem encoded into an Ising spin Hamiltonian are linked together to increase the logica... Read More about Using copies can improve precision in continuous-time quantum computing.

Comparing the hardness of MAX 2-SAT problem instances for quantum and classical algorithms (2023)
Journal Article
Mirkarimi, P., Callison, A., Light, L., Chancellor, N., & Kendon, V. (2023). Comparing the hardness of MAX 2-SAT problem instances for quantum and classical algorithms. Physical Review Research, 5(2), https://doi.org/10.1103/physrevresearch.5.023151

An algorithm for a particular problem may find some instances of the problem easier and others harder to solve, even for a fixed input size. We numerically analyze the relative hardness of MAX 2-SAT problem instances for various continuous-time quant... Read More about Comparing the hardness of MAX 2-SAT problem instances for quantum and classical algorithms.

NP-hard but no longer hard to solve? Using quantum computing to tackle optimization problems (2023)
Journal Article
Au-Yeung, R., Chancellor, N., & Halffmann, P. (2023). NP-hard but no longer hard to solve? Using quantum computing to tackle optimization problems. Quantum Science and Technology, 2, Article 1128576. https://doi.org/10.3389/frqst.2023.1128576

In the last decade, public and industrial research funding has moved quantum computing from the early promises of Shor’s algorithm through experiments to the era of noisy intermediate scale quantum devices (NISQ) for solving real-world problems. It i... Read More about NP-hard but no longer hard to solve? Using quantum computing to tackle optimization problems.