Ophelia Crawford

ORCID: 0000-0001-7654-1661
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Quantum Computing Algorithms and Architecture
  • Quantum Information and Cryptography
  • Quantum and electron transport phenomena
  • Low-power high-performance VLSI design
  • Advancements in Semiconductor Devices and Circuit Design
  • Quantum Mechanics and Applications
  • VLSI and Analog Circuit Testing
  • Advanced Chemical Physics Studies
  • Numerical methods in inverse problems
  • Adversarial Robustness in Machine Learning
  • Quantum-Dot Cellular Automata
  • Disaster Response and Management
  • Resilience and Mental Health
  • Quantum many-body systems
  • Advanced Data Storage Technologies
  • Innovative Microfluidic and Catalytic Techniques Innovation
  • Spectroscopy and Quantum Chemical Studies
  • Cold Atom Physics and Bose-Einstein Condensates
  • Criminal Justice and Corrections Analysis
  • Spectral Theory in Mathematical Physics

Riverlane (United Kingdom)
2021-2024

St Andrew's Healthcare
2023-2024

Estimating the expectation value of an operator corresponding to observable is a fundamental task in quantum computation. It often impossible obtain such estimates directly, as computer restricted measuring fixed computational basis. One common solution splits into weighted sum Pauli operators and measures each separately, at cost many measurements. An improved version collects mutually commuting together before all within collection simultaneously. The effectiveness doing this depends on...

10.22331/q-2021-01-20-385 article EN cc-by Quantum 2021-01-20

Error corrected quantum computers have the potential to change way we solve computational problems. Quantum error correction involves repeated rounds of carefully scheduled gates measure stabilizers a code. A set scheduling rules is typically imposed on order ensure that circuit can be rearranged into an equivalent easily seen stabilizers. In this work, ask what would happen if break these and instead use schedules describe as tangled. We find tangling generates long-range entanglement not...

10.1103/prxquantum.5.010348 article EN cc-by PRX Quantum 2024-03-20

Abstract Quantum computers are special purpose machines that expected to be particularly useful in simulating strongly correlated chemical systems. The quantum computer excels at treating a moderate number of orbitals within an active space fully mechanical manner. We present phase estimation calculation on F 2 (2,2) Rigetti's Aspen‐11 QPU. While this is promising start, it also underlines the need for carefully selecting orbital spaces treated by computer. In work, scheme such automatically...

10.1002/jcc.26958 article EN Journal of Computational Chemistry 2022-07-05

Quantum error correction enables the preservation of logical qubits with a lower rate than physical rate, performance depending on decoding method. Traditional approaches rely binarization (“hardening”) readout data, thereby ignoring valuable information embedded in analog (“soft”) signal. We present experimental results showcasing advantages incorporating soft into process distance-3 (<a:math xmlns:a="http://www.w3.org/1998/Math/MathML" display="inline"...

10.1103/physrevapplied.22.044031 article EN cc-by Physical Review Applied 2024-10-11

Abstract Inspired by the challenge of scaling-up existing silicon quantum hardware, we propose a 2d spin-qubit architecture with low compilation overhead. The is based on nanowire split-gate transistors which form 1d chains spin-qubits and allow execution two-qubit operations among neighbors. We introduce junction can couple four nanowires into arrangements via spin shuttling Swap operations. then modular sparse unit cells diagonally-oriented squares along edges junctions corners. Targeting...

10.1038/s41534-023-00679-8 article EN cc-by npj Quantum Information 2023-02-22

We simulate the logical Hadamard gate in surface code under a circuit-level noise model, compiling it to physical circuit on square-grid connectivity hardware. Our paper is first do this for unitary quantum error-correction code. consider two proposals, both via patch-deformation: one that applies transversal (i.e. domain wall through time) interchange <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>X</mml:mi></mml:math> and...

10.22331/q-2024-07-02-1394 article EN cc-by Quantum 2024-07-02

Quantum computers have the potential to change way we solve computational problems. Due noisy nature of qubits, need arises correct physical errors occurring during computation. The surface code is a promising candidate for such error correction that shows high threshold and which can store logical quantum state on hardware with square-grid connectivity, type device already exists. However, computation, measurement some irregular, non-local stabilisers required, it not currently known how do...

10.1109/qce57702.2023.10273 article EN 2022 IEEE International Conference on Quantum Computing and Engineering (QCE) 2023-09-17

Leakage from the computational subspace is a damaging source of noise that degrades performance most qubit types. Unlike other types noise, leakage cannot be overcome by standard quantum error correction techniques and requires dedicated reduction units. In this work, we study effects mobility between superconducting qubits on stability experiment, which benchmark for fault-tolerant logical computation. Using Fujitsu Quantum Simulator, perform full density-matrix simulations experiments...

10.48550/arxiv.2406.04083 preprint EN arXiv (Cornell University) 2024-06-06

Quantum error correction (QEC) will be essential to achieve the accuracy needed for quantum computers realise their full potential. The field has seen promising progress with demonstrations of early QEC and real-time decoded experiments. As advance towards demonstrating a universal fault-tolerant logical gate set, implementing scalable low-latency decoding crucial prevent backlog problem, avoiding an exponential slowdown maintaining fast clock rate. Here, we demonstrate feedback FPGA decoder...

10.48550/arxiv.2410.05202 preprint EN arXiv (Cornell University) 2024-10-07

Quantum error correction enables the preservation of logical qubits with a lower rate than physical rate, performance depending on decoding method. Traditional approaches, relying binarization (`hardening') readout data, often ignore valuable information embedded in analog (`soft') signal. We present experimental results showcasing advantages incorporating soft into process distance-three ($d=3$) bit-flip surface code transmons. To this end, we use $3\times3$ data-qubit array to encode each...

10.48550/arxiv.2403.00706 preprint EN arXiv (Cornell University) 2024-03-01

Whether to reset qubits, or not, during quantum error correction experiments is a question of both foundational and practical importance for computing. Text-book demands that qubits are after measurement. However, fast qubit has proven challenging execute at high fidelity. Consequently, many cutting-edge opting the no-reset approach, where physical not performed. It recently been postulated functionally equivalent procedures, as well being faster easier. For memory experiments, we confirm...

10.48550/arxiv.2408.00758 preprint EN arXiv (Cornell University) 2024-08-01

Quantum computers have the potential to change way we solve computational problems. Due noisy nature of qubits, need arises correct physical errors occurring during computation. The surface code is a promising candidate for such error correction that shows high threshold and which can store logical quantum state on hardware with square-grid connectivity, type device already exists. However, computation, measurement some irregular, non-local stabilisers required, it not currently known how do...

10.48550/arxiv.2307.10147 preprint EN other-oa arXiv (Cornell University) 2023-01-01

We simulate the logical Hadamard gate in surface code under a circuit-level noise model, compiling it to physical circuit on square-grid connectivity hardware. Our paper is first do this for unitary quantum error-correction code. consider two proposals, both via patch-deformation: one that applies transversal (i.e. domain wall through time) interchange $X$ and $Z$ strings, another space achieve interchange. explain detail why they perform by tracking how stabilisers operators are transformed...

10.48550/arxiv.2312.11605 preprint EN other-oa arXiv (Cornell University) 2023-01-01
Coming Soon ...