Optimal Partitioning of Quantum Circuits Using Gate Cuts and Wire Cuts
A limited number of qubits, high error rates, and limited qubit connectivity are major challenges for effective near-term quantum computations. Quantum circuit partitioning divides a quantum computation into classical postprocessing steps and a set of smaller scale quantum computations that individu...
Saved in:
Main Authors: | Sebastian Brandhofer, Ilia Polian, Kevin Krsulich |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2024-01-01
|
Series: | IEEE Transactions on Quantum Engineering |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/10374226/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Probing Quantum Telecloning on Superconducting Quantum Processors
by: Elijah Pelofske, et al.
Published: (2024-01-01) -
Quantum Circuit for Imputation of Missing Data
by: Claudio Sanavio, et al.
Published: (2024-01-01) -
Simulating Quantum Field Theories on Gate-Based Quantum Computers
by: Gayathree M. Vinod, et al.
Published: (2024-01-01) -
Energy Risk Analysis With Dynamic Amplitude Estimation and Piecewise Approximate Quantum Compiling
by: Kumar Ghosh, et al.
Published: (2024-01-01) -
Multiobjective Optimization and Network Routing With Near-Term Quantum Computers
by: Shao-Hen Chiew, et al.
Published: (2024-01-01)