Hardware-efficient preparation of architecture-specific graph states on near-term quantum computers
Abstract Highly entangled quantum states are an ingredient in numerous applications in quantum computing. However, preparing these highly entangled quantum states on currently available quantum computers at high fidelity is limited by ubiquitous errors. Besides improving the underlying technology of...
Saved in:
Main Authors: | Sebastian Brandhofer, Ilia Polian, Stefanie Barz, Daniel Bhatti |
---|---|
Format: | Article |
Language: | English |
Published: |
Nature Portfolio
2025-01-01
|
Series: | Scientific Reports |
Online Access: | https://doi.org/10.1038/s41598-024-82715-x |
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) -
Multiobjective Optimization and Network Routing With Near-Term Quantum Computers
by: Shao-Hen Chiew, et al.
Published: (2024-01-01) -
Long-time error-mitigating simulation of open quantum systems on near term quantum computers
by: Brian Rost, et al.
Published: (2025-01-01) -
Resource Efficient Hardware Architecture for Fast Computation of Running Max/Min Filters
by: Cesar Torres-Huitzil
Published: (2013-01-01) -
Hardware Architecture for Real-Time Computation of Image Component Feature Descriptors on a FPGA
by: Abdul Waheed Malik, et al.
Published: (2014-01-01)