Skip to main content

Research Repository

Advanced Search

Outputs (25)

Generalizing multipartite concentratable entanglement for practical applications: mixed, qudit and optical states (2024)
Journal Article
Foulds, S., Prove, O., & Kendon, V. (2024). Generalizing multipartite concentratable entanglement for practical applications: mixed, qudit and optical states. Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 382(2287), Article 20240411. https://doi.org/10.1098/rsta.2024.0411

The controlled SWAP test for detecting and quantifying entanglement applied to pure qubit states is robust to small errors in the states and efficient for large multi-qubit states (Foulds et al. 2021 Quantum Sci. Technol. 6, 035002 (doi:10.1088/2058-... Read More about Generalizing multipartite concentratable entanglement for practical applications: mixed, qudit and optical states.

Quantum algorithms for scientific computing. (2024)
Journal Article
Au-Yeung, R., Camino, B., Rathore, O., & Kendon, V. (2024). Quantum algorithms for scientific computing. Reports on Progress in Physics, 87(11), Article 116001. https://doi.org/10.1088/1361-6633/ad85f0

Quantum computing promises to provide the next step up in computational power for diverse application areas. In this review, we examine the science behind the quantum hype, and the breakthroughs required to achieve true quantum advantage in real worl... Read More about Quantum algorithms for scientific computing..

Cycle discrete-time quantum walks on a noisy quantum computer (2024)
Journal Article
Wadhia, V., Chancellor, N., & Kendon, V. (2024). Cycle discrete-time quantum walks on a noisy quantum computer. The European Physical Journal D, 78(3), Article 29. https://doi.org/10.1140/epjd/s10053-023-00795-2

The rapid development of quantum computing has led to increasing interest in quantum algorithms for a variety of different applications. Quantum walks have also experienced a surge in interest due to their potential use in quantum algorithms. Using t... Read More about Cycle discrete-time quantum walks on a noisy quantum computer.

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.

Experimental test of search range in quantum annealing (2021)
Journal Article
Chancellor, N., & Kendon, V. (2021). Experimental test of search range in quantum annealing. Physical Review A, 104(1), Article 012604. https://doi.org/10.1103/physreva.104.012604

We construct an Ising Hamiltonian with an engineered energy landscape such that it has a local energy minimum which is near the true global minimum solution and further away from a false minimum. Using a technique established in previous experiments,... Read More about Experimental test of search range in quantum annealing.

The controlled SWAP test for determining quantum entanglement (2021)
Journal Article
Foulds, S., Kendon, V., & Spiller, T. (2021). The controlled SWAP test for determining quantum entanglement. Quantum Science and Technology, 6(3), Article 035002. https://doi.org/10.1088/2058-9565/abe458

Quantum entanglement is essential to the development of quantum computation, communications, and technology. The controlled SWAP test, widely used for state comparison, can be adapted to an efficient and useful test for entanglement of a pure state.... Read More about The controlled SWAP test for determining quantum entanglement.

Energetic Perspective on Rapid Quenches in Quantum Annealing (2021)
Journal Article
Callison, A., Festenstein, M., Chen, J., Nita, L., Kendon, V., & Chancellor, N. (2021). Energetic Perspective on Rapid Quenches in Quantum Annealing. PRX Quantum, 2(1), Article 010338. https://doi.org/10.1103/prxquantum.2.010338

There are well-developed theoretical tools to analyze how quantum dynamics can solve computational problems by varying Hamiltonian parameters slowly, near the adiabatic limit. On the other hand, there are relatively few tools to understand the opposi... Read More about Energetic Perspective on Rapid Quenches in Quantum Annealing.

The representational entity in physical computing (2020)
Journal Article
Stepney, S., & Kendon, V. (2021). The representational entity in physical computing. Natural Computing, 20(2), 233-242. https://doi.org/10.1007/s11047-020-09805-3

We have developed abstraction/representation (AR) theory to answer the question “When does a physical system compute?” AR theory requires the existence of a representational entity (RE), but the vanilla theory does not explicitly include the RE in it... Read More about The representational entity in physical computing.