Zhenyu Cai
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Zhenyu Cai has a total of 98 co-authors. Here are the top co-authors by number of shared publications:
- Simon Charles Benjamin
Department of Materials, University of Oxford, Oxford OX1 3PH, United Kingdom
13 shared publications - Bálint Koczor
Mathematical Institute University of Oxford Woodstock Road OX2 6GG Oxford United Kingdom
4 shared publications - Hamza Jnane
Quantum Motion
4 shared publications - Zhenhuan Liu
Tsinghua University
3 shared publications - Adam Siegel
Quantum Motion
2 shared publications - Gregory Boyd
Quantum Motion 9 Sterling Way N7 9HJ London United Kingdom
2 shared publications
Latest Publications
- Open Access
- 22 June 2026
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 11 (3) , 035020
Noise-aware time-optimal quantum control
Quantum optimal control plays a vital role in many quantum technologies, including quantum computation. One of the most important control parameters to optimise for is the evolution time (pulse duration). However, most existing works focus on finding the shortest evolution time theoretically possible without offering explicit pulse constructions under practical constraints like noise in the system. This paper addresses these limitations by introducing an efficient method to perform the chopped random basis optimisation in the presence of noise, specifically when the noise commutes with the gate Hamiltonian, i.e. when the unitary and dissipative parts of the Liouvillian commute. This noise-aware approach allows for direct optimisation of the evolution time alongside other control parameters, significantly reducing the computational cost compared to full noisy simulations. The protocol is demonstrated through numerical simulations on state-to-state transfer and gate compilation problems under several noise models. Results show that the optimised fidelity has a strong dependence on evolution time due to noise, drift Hamiltonian, and local traps in optimisation, highlighting the necessity of optimising evolution time in practical settings that can lead to a substantial gain in the fidelity. Our pulse optimisation protocol can consistently escape from many local minima in all of our examples. We hope that our protocol can be the start of many more works on the crucial topic of control pulse time optimisation in practical settings.
- 22 June 2026
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 11 (3) , 035020
Open AccessNoise-aware time-optimal quantum control
Quantum optimal control plays a vital role in many quantum technologies, including quantum computation. One of the most important control parameters to optimise for is the evolution time (pulse duration). However, most existing works focus on finding the shortest evolution time theoretically possible without offering explicit pulse constructions under practical constraints like noise in the system. This paper addresses these limitations by introducing an efficient method to perform the chopped random basis optimisation in the presence of noise, specifically when the noise commutes with the gate Hamiltonian, i.e. when the unitary and dissipative parts of the Liouvillian commute. This noise-aware approach allows for direct optimisation of the evolution time alongside other control parameters, significantly reducing the computational cost compared to full noisy simulations. The protocol is demonstrated through numerical simulations on state-to-state transfer and gate compilation problems under several noise models. Results show that the optimised fidelity has a strong dependence on evolution time due to noise, drift Hamiltonian, and local traps in optimisation, highlighting the necessity of optimising evolution time in practical settings that can lead to a substantial gain in the fidelity. Our pulse optimisation protocol can consistently escape from many local minima in all of our examples. We hope that our protocol can be the start of many more works on the crucial topic of control pulse time optimisation in practical settings.
- 20 March 2026
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 136 (11) , 110804
Experimental Quantum Channel Purification
Quantum networks, which integrate multiple quantum computers and the channels connecting them, are crucial for distributed quantum information processing but remain inherently susceptible to channel noise. Channel purification emerges as a promising technique for suppressing noise in quantum channels without complex encoding and decoding operations, making it particularly suitable for remote quantum information transmission in optical systems. In this Letter, we introduce an experimental setup for efficient channel purification, harnessing the spatial and polarization properties of photons. Our design employs two Fredkin gates to enable coherent interference between independent noise channels, achieving effective noise suppression across a wide range of noise levels and types. Through application to entanglement distribution, channel purification demonstrates a strong capability to preserve entanglement under channel noise, suggesting that it can serve as a complementary and resource-efficient alternative to conventional entanglement purification in quantum network tasks.
- 20 March 2026
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 136 (11) , 110804
Experimental Quantum Channel Purification
Quantum networks, which integrate multiple quantum computers and the channels connecting them, are crucial for distributed quantum information processing but remain inherently susceptible to channel noise. Channel purification emerges as a promising technique for suppressing noise in quantum channels without complex encoding and decoding operations, making it particularly suitable for remote quantum information transmission in optical systems. In this Letter, we introduce an experimental setup for efficient channel purification, harnessing the spatial and polarization properties of photons. Our design employs two Fredkin gates to enable coherent interference between independent noise channels, achieving effective noise suppression across a wide range of noise levels and types. Through application to entanglement distribution, channel purification demonstrates a strong capability to preserve entanglement under channel noise, suggesting that it can serve as a complementary and resource-efficient alternative to conventional entanglement purification in quantum network tasks.
- Top Cited PapersOpen Access
- 25 February 2026
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 7 (1)
Quantum Snakes on a Plane: Mobile, Low-Dimensional Logical Qubits on a 2D Surface
Recent demonstrations indicate that silicon-spin quantum processing unit will be able to shuttle physical qubits rapidly and with high fidelity—a desirable feature for maximizing logical connectivity, supporting new codes, and routing around damage. However it may seem that shuttling at the logical level is unwise: static defects in the device may “scratch” a logical qubit as it passes, causing correlated errors to which the code is highly vulnerable. Here we explore an architecture where logical qubits are 1D strings (“snakes”) which can be moved freely over a planar latticework. Possible scratch events are inferred via monitor qubits and the complementary gap; if deemed a risk, remarkably the shuttle process can be undone in a way that negates any corruption. This leads to high levels of tolerance against shuttling-related imperfections and enables logical operations between snakes by a semitransversal method. We conclude that this approach is suitable for fault-tolerant computing in both near-term and long-term, mature-era silicon devices.
- 25 February 2026
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 7 (1)
Top Cited PapersOpen AccessQuantum Snakes on a Plane: Mobile, Low-Dimensional Logical Qubits on a 2D Surface
Recent demonstrations indicate that silicon-spin quantum processing unit will be able to shuttle physical qubits rapidly and with high fidelity—a desirable feature for maximizing logical connectivity, supporting new codes, and routing around damage. However it may seem that shuttling at the logical level is unwise: static defects in the device may “scratch” a logical qubit as it passes, causing correlated errors to which the code is highly vulnerable. Here we explore an architecture where logical qubits are 1D strings (“snakes”) which can be moved freely over a planar latticework. Possible scratch events are inferred via monitor qubits and the complementary gap; if deemed a risk, remarkably the shuttle process can be undone in a way that negates any corruption. This leads to high levels of tolerance against shuttling-related imperfections and enables logical operations between snakes by a semitransversal method. We conclude that this approach is suitable for fault-tolerant computing in both near-term and long-term, mature-era silicon devices.
- Open Access
Quantum Error Correction on Error-mitigated Physical Qubits
We present a general framework for applying linear quantum error mitigation (QEM) techniques directly to physical qubits within a logical qubit to suppress logical errors. By exploiting the linearity of quantum error correction (QEC), we demonstrate that any linear QEM method$\unicode{x2014}$including probabilistic error cancellation (PEC), zero-noise extrapolation (ZNE), and symmetry verification$\unicode{x2014}$can be integrated into the physical layer without requiring modifications to the subsequent QEC decoder. Applying this framework to memory experiments using PEC, we analytically prove and numerically verify that the leading-order contribution to the logical error can be removed, increasing the effective code distance by 2. Our simulations on repetition and rotated surface codes show that a distance-3 code with physical-level PEC achieves logical error rates lower than or similar to a distance-5 unmitigated code while using 40% and 64% fewer qubits, respectively. These results establish physical-level QEM as a widely compatible and resource-efficient strategy for enhancing logical performance in early fault-tolerant architectures.
Open AccessQuantum Error Correction on Error-mitigated Physical Qubits
We present a general framework for applying linear quantum error mitigation (QEM) techniques directly to physical qubits within a logical qubit to suppress logical errors. By exploiting the linearity of quantum error correction (QEC), we demonstrate that any linear QEM method$\unicode{x2014}$including probabilistic error cancellation (PEC), zero-noise extrapolation (ZNE), and symmetry verification$\unicode{x2014}$can be integrated into the physical layer without requiring modifications to the subsequent QEC decoder. Applying this framework to memory experiments using PEC, we analytically prove and numerically verify that the leading-order contribution to the logical error can be removed, increasing the effective code distance by 2. Our simulations on repetition and rotated surface codes show that a distance-3 code with physical-level PEC achieves logical error rates lower than or similar to a distance-5 unmitigated code while using 40% and 64% fewer qubits, respectively. These results establish physical-level QEM as a widely compatible and resource-efficient strategy for enhancing logical performance in early fault-tolerant architectures.
- Top Cited PapersOpen Access
- 2 December 2025
- Published by Springer Nature in Nature Communications
- Vol. 16 (1) , 10829
Artificial intelligence for quantum computing
Artificial intelligence (AI) advancements over the past few years have had an unprecedented and revolutionary impact across everyday application areas. Its significance also extends to technical challenges within science and engineering, including the nascent field of quantum computing (QC). The counterintuitive nature and high-dimensional mathematics of QC make it a prime candidate for AI’s data-driven learning capabilities, and in fact, many of QC’s biggest scaling challenges may ultimately rest on developments in AI. However, bringing leading techniques from AI to QC requires drawing on disparate expertise from arguably two of the most advanced and esoteric areas of computer science. Here we aim to encourage this cross-pollination by reviewing how state-of-the-art AI techniques are already advancing challenges across the hardware and software stack needed to develop useful QC - from device design to applications. We then close by examining its future opportunities and obstacles in this space.
- 2 December 2025
- Published by Springer Nature in Nature Communications
- Vol. 16 (1) , 10829
Top Cited PapersOpen AccessArtificial intelligence for quantum computing
Artificial intelligence (AI) advancements over the past few years have had an unprecedented and revolutionary impact across everyday application areas. Its significance also extends to technical challenges within science and engineering, including the nascent field of quantum computing (QC). The counterintuitive nature and high-dimensional mathematics of QC make it a prime candidate for AI’s data-driven learning capabilities, and in fact, many of QC’s biggest scaling challenges may ultimately rest on developments in AI. However, bringing leading techniques from AI to QC requires drawing on disparate expertise from arguably two of the most advanced and esoteric areas of computer science. Here we aim to encourage this cross-pollination by reviewing how state-of-the-art AI techniques are already advancing challenges across the hardware and software stack needed to develop useful QC - from device design to applications. We then close by examining its future opportunities and obstacles in this space.
- Open Access
No Universal Purification in Quantum Mechanics
We prove that the linearity and positivity of quantum mechanics impose general restrictions on quantum purification, unveiling a new fundamental limitation of quantum information processing. In particular, no quantum operation can transform a finite number of copies of an unknown quantum state or channel into a pure state or channel that depends on the input, thereby ruling out an important form of universal purification in both static and dynamical settings. Relaxing the requirement of exact pure output, we further extend our result to establish quantitative sample complexity bounds for approximate purification, independent of any task details or operational constraints. To illustrate the practical consequences of this principle, we examine the task of approximately preparing pure dilation and, for the first time, prove an exponential lower bound on the required sample complexity.
Open AccessNo Universal Purification in Quantum Mechanics
We prove that the linearity and positivity of quantum mechanics impose general restrictions on quantum purification, unveiling a new fundamental limitation of quantum information processing. In particular, no quantum operation can transform a finite number of copies of an unknown quantum state or channel into a pure state or channel that depends on the input, thereby ruling out an important form of universal purification in both static and dynamical settings. Relaxing the requirement of exact pure output, we further extend our result to establish quantitative sample complexity bounds for approximate purification, independent of any task details or operational constraints. To illustrate the practical consequences of this principle, we examine the task of approximately preparing pure dilation and, for the first time, prove an exponential lower bound on the required sample complexity.
- Open Access
- 16 June 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 111 (6)
Low-depth phase oracle using a parallel piecewise circuit
We explore the important task of applying a phase exp ( i f ( x ) ) to a computational basis state | x 〉 . The closely related task of rotating a target qubit by an angle depending on f ( x ) is also studied. Such operations are key in many quantum subroutines, and frequently f ( x ) can be well approximated by a piecewise function; examples range from the application of diagonal Hamiltonian terms (such as the Coulomb interaction) in grid-based many-body simulation to derivative pricing algorithms. Here, we exploit a parallelization of the piecewise approach so that all constituent elementary rotations are performed simultaneously, that is, we achieve a total rotation depth of one. Moreover, we explore the use of recursive catalyst “towers” to implement these elementary rotations efficiently. We find that strategies prioritizing execution speed can achieve circuit depth as low as O ( log 2 n + log 2 S ) for a register of n qubits and a piecewise approximation of S sections (presuming prior preparation of enabling resource states), albeit total qubit count then scales with S . In the limit of multiple repetitions of the oracle, we find that catalyst tower approaches have an O ( S n ) T -count. Published by the American Physical Society 2025
- 16 June 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 111 (6)
Open AccessLow-depth phase oracle using a parallel piecewise circuit
We explore the important task of applying a phase exp ( i f ( x ) ) to a computational basis state | x 〉 . The closely related task of rotating a target qubit by an angle depending on f ( x ) is also studied. Such operations are key in many quantum subroutines, and frequently f ( x ) can be well approximated by a piecewise function; examples range from the application of diagonal Hamiltonian terms (such as the Coulomb interaction) in grid-based many-body simulation to derivative pricing algorithms. Here, we exploit a parallelization of the piecewise approach so that all constituent elementary rotations are performed simultaneously, that is, we achieve a total rotation depth of one. Moreover, we explore the use of recursive catalyst “towers” to implement these elementary rotations efficiently. We find that strategies prioritizing execution speed can achieve circuit depth as low as O ( log 2 n + log 2 S ) for a register of n qubits and a piecewise approximation of S sections (presuming prior preparation of enabling resource states), albeit total qubit count then scales with S . In the limit of multiple repetitions of the oracle, we find that catalyst tower approaches have an O ( S n ) T -count. Published by the American Physical Society 2025
- Open Access
- 6 May 2025
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 6 (2)
Virtual Channel Purification
Quantum error mitigation is a key approach for extracting target state properties on state-of-the-art noisy machines and early fault-tolerant devices. Using the ideas from flag fault tolerance and virtual state purification, we develop the virtual-channel-purification (VCP) protocol, which consumes similar qubit and gate resources as virtual state purification but offers stronger error suppression with increased system size and more noisy operation copies. The application of VCP does not require specific knowledge about the target quantum state, the target problem and the gate noise model in the target circuit, and can still offer rigorous performance guarantees for practical noise regimes as long as the noise is incoherent. Further connections are made between VCP and quantum error correction to produce the virtual error-correction (VEC) protocol, one of the first protocols that combine quantum error correction (QEC) and quantum error mitigation beyond directly applying error-mitigation protocols on top of logical qubits. Assuming perfect syndrome extraction, VEC can virtually remove all correctable noise in the channel while paying only the same sampling cost as low-order purification. It can achieve QEC-level protection on an unencoded register when transmitting it through a noisy channel, removing the associated encoding qubit overhead. Another variant of VEC can mimic the error-suppression power of the surface code by inputting only a bit-flip and a phase-flip code. Our protocol can also be adapted to key tasks in quantum networks like channel capacity activation and entanglement distribution. Published by the American Physical Society 2025
- 6 May 2025
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 6 (2)
Open AccessVirtual Channel Purification
Quantum error mitigation is a key approach for extracting target state properties on state-of-the-art noisy machines and early fault-tolerant devices. Using the ideas from flag fault tolerance and virtual state purification, we develop the virtual-channel-purification (VCP) protocol, which consumes similar qubit and gate resources as virtual state purification but offers stronger error suppression with increased system size and more noisy operation copies. The application of VCP does not require specific knowledge about the target quantum state, the target problem and the gate noise model in the target circuit, and can still offer rigorous performance guarantees for practical noise regimes as long as the noise is incoherent. Further connections are made between VCP and quantum error correction to produce the virtual error-correction (VEC) protocol, one of the first protocols that combine quantum error correction (QEC) and quantum error mitigation beyond directly applying error-mitigation protocols on top of logical qubits. Assuming perfect syndrome extraction, VEC can virtually remove all correctable noise in the channel while paying only the same sampling cost as low-order purification. It can achieve QEC-level protection on an unencoded register when transmitting it through a noisy channel, removing the associated encoding qubit overhead. Another variant of VEC can mimic the error-suppression power of the surface code by inputting only a bit-flip and a phase-flip code. Our protocol can also be adapted to key tasks in quantum networks like channel capacity activation and entanglement distribution. Published by the American Physical Society 2025
- Open Access
- 21 March 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 111 (3)
Biased estimator channels for classical shadows
Extracting classical information from quantum systems is of fundamental importance, and classical shadows allow us to extract a large amount of information using relatively few measurements. Conventional shadow estimators are unbiased and thus agree with the true mean in expectation. In this Letter, we consider a biased scheme, intentionally introducing a bias in the expectation value by rescaling the conventional classical-shadow estimators to reduce the error in the finite-sample regime. The approach is straightforward to implement and requires no quantum resources. We analytically prove average-case as well as worst- and best-case scenarios, and rigorously prove that it is, in principle, always worth biasing the estimators. We illustrate our approach in a quantum simulation task of a 12-qubit spin-ring problem and demonstrate how estimating expected values of nonlocal perturbations can be significantly more efficient using our biased scheme.
- 21 March 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 111 (3)
Open AccessBiased estimator channels for classical shadows
Extracting classical information from quantum systems is of fundamental importance, and classical shadows allow us to extract a large amount of information using relatively few measurements. Conventional shadow estimators are unbiased and thus agree with the true mean in expectation. In this Letter, we consider a biased scheme, intentionally introducing a bias in the expectation value by rescaling the conventional classical-shadow estimators to reduce the error in the finite-sample regime. The approach is straightforward to implement and requires no quantum resources. We analytically prove average-case as well as worst- and best-case scenarios, and rigorously prove that it is, in principle, always worth biasing the estimators. We illustrate our approach in a quantum simulation task of a 12-qubit spin-ring problem and demonstrate how estimating expected values of nonlocal perturbations can be significantly more efficient using our biased scheme.
- Open Access
- 20 February 2025
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 6 (1)
Erratum: Looped Pipelines Enabling Effective 3D Qubit Lattices in a Strictly 2D Device [PRX Quantum 4, 020345 (2023)]
- 20 February 2025
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 6 (1)
Open AccessErratum: Looped Pipelines Enabling Effective 3D Qubit Lattices in a Strictly 2D Device [PRX Quantum 4, 020345 (2023)]