Probabilistic state synthesis based on optimal convex approximation
Abstract When preparing a pure state with a quantum circuit, there is an unavoidable approximation error due to the compilation error in fault-tolerant implementation. A recently proposed approach called probabilistic state synthesis, where the circuit is probabilistically sampled, is able to reduce...
Main Authors: | Seiseki Akibue, Go Kato, Seiichiro Tani |
---|---|
Format: | Article |
Language: | English |
Published: |
Nature Portfolio
2024-01-01
|
Series: | npj Quantum Information |
Online Access: | https://doi.org/10.1038/s41534-023-00793-7 |
Similar Items
-
Scalable implementation of (d+1) mutually unbiased bases for d-dimensional quantum key distribution
by: Takuya Ikuta, et al.
Published: (2022-10-01) -
Convexity, Markov Operators, Approximation, and Related Optimization
by: Octav Olteanu
Published: (2022-08-01) -
Polyhedral approximation in mixed-integer convex optimization
by: Yamangil, Emre, et al.
Published: (2018) -
Approximation Algorithm Variants for Convex Multiobjective Optimization Problems
by: Firdevs ULUS
Published: (2020-03-01) -
A Unifying Polyhedral Approximation Framework for Convex Optimization
by: Bertsekas, Dimitri P., et al.
Published: (2011)