Optimal Quantum Circuit Cuts with Application to Clustered Hamiltonian Simulation
We study methods to replace entangling operations with random local operations in a quantum computation, at the cost of increasing the number of required executions. First, we consider “spacelike cuts” where an entangling unitary is replaced with random local unitaries. We propose an entanglement me...
Saved in:
Main Authors: | Aram W. Harrow, Angus Lowe |
---|---|
Format: | Article |
Language: | English |
Published: |
American Physical Society
2025-01-01
|
Series: | PRX Quantum |
Online Access: | http://doi.org/10.1103/PRXQuantum.6.010316 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Optimal Partitioning of Quantum Circuits Using Gate Cuts and Wire Cuts
by: Sebastian Brandhofer, et al.
Published: (2024-01-01) -
Mitigating errors in analog quantum simulation by Hamiltonian reshaping or Hamiltonian rescaling
by: Rui-Cheng Guo, et al.
Published: (2025-01-01) -
Hybrid Hamiltonian Simulation Approach for the Analysis of Quantum Error Correction Protocol Robustness
by: Benjamin Gys, et al.
Published: (2024-01-01) -
Quantum complexity of time evolution with chaotic Hamiltonians
by: Vijay Balasubramanian, et al.
Published: (2020-01-01) -
Extremal jumps of circuit complexity of unitary evolutions generated by random Hamiltonians
by: Marcin Kotowski, et al.
Published: (2025-01-01)