Cover Image

Rewindable Quantum Computation and Its Equivalence to Cloning and Adaptive Postselection

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hiromasa, Ryo, Mizutani, Akihiro, Takeuchi, Yuki, Tani, Seiichiro
Format:	Preprint
Published:	2022
Subjects:	Quantum Physics Computational Complexity
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Approximate Degrees of Multisymmetric Properties with Application to Quantum Claw Detection
by: Tani, Seiichiro
Published: (2024)

Quantum Algorithm for Finding the Optimal Variable Ordering for Binary Decision Diagrams
by: Tani, Seiichiro
Published: (2019)

Modifications of Quantum Computation and Adaptive Queries to PP
by: Miloschewsky, David, et al.
Published: (2025)

Hamiltonian Locality Testing via Trotterized Postselection
by: Kallaugher, John, et al.
Published: (2025)

Quantum algorithm for unstructured search of ranked targets
by: Tani, Kota, et al.
Published: (2024)

Unconditional verification of quantum computation with classical light
by: Takeuchi, Yuki, et al.
Published: (2024)

The Power of Lorentz Quantum Computer
by: Zhang, Qi, et al.
Published: (2024)

Bosonic Quantum Computational Complexity
by: Chabaud, Ulysse, et al.
Published: (2024)

New Quantum Algorithms for Computing Quantum Entropies and Distances
by: Wang, Qisheng, et al.
Published: (2022)

Elementary Quantum Recursion Schemes That Capture Quantum Polylogarithmic Time Computability of Quantum Functions
by: Yamakami, Tomoyuki
Published: (2023)

The Space-Time Cost of Purifying Quantum Computations
by: Zhandry, Mark
Published: (2024)

Computational Complexity and Simulability of Non-Hermitian Quantum Dynamics
by: Barch, Brian, et al.
Published: (2025)

Quantum PCPs: on Adaptivity, Multiple Provers and Reductions to Local Hamiltonians
by: Buhrman, Harry, et al.
Published: (2024)

New Lower-bounds for Quantum Computation with Non-Collapsing Measurements
by: Miloschewsky, David, et al.
Published: (2024)

From Worst-Case Hardness of $\mathsf{NP}$ to Quantum Cryptography via Quantum Indistinguishability Obfuscation
by: Morimae, Tomoyuki, et al.
Published: (2025)

Coherent-State Propagation: A Computational Framework for Simulating Bosonic Quantum Systems
by: Guseynov, Nikita, et al.
Published: (2026)

Quantum Cryptography and Hardness of Non-Collapsing Measurements
by: Morimae, Tomoyuki, et al.
Published: (2025)

A Schematic Definition of Quantum Polynomial Time Computability
by: Yamakami, Tomoyuki
Published: (2018)

Quantum Public-Key Encryption with Tamper-Resilient Public Keys from One-Way Functions
by: Kitagawa, Fuyuki, et al.
Published: (2023)

Chemically Motivated Simulation Problems are Efficiently Solvable by a Quantum Computer
by: Schleich, Philipp, et al.
Published: (2024)

On the Computational Hardness of Quantum One-Wayness
by: Cavalar, Bruno, et al.
Published: (2023)

Anonymous quantum sensing robust against state preparation errors
by: Kasai, Hiroto, et al.
Published: (2026)

Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture
by: Gharibian, Sevag, et al.
Published: (2021)

Quantum First-Order Logics That Capture Logarithmic-Time/Space Quantum Computability
by: Yamakami, Tomoyuki
Published: (2025)

A Computational Separation Between Quantum No-cloning and No-telegraphing
by: Nehoran, Barak, et al.
Published: (2023)

Sampling Frequency Thresholds for Quantum Advantage of Quantum Approximate Optimization Algorithm
by: Lykov, Danylo, et al.
Published: (2022)

Computational complexity of isometric tensor network states
by: Malz, Daniel, et al.
Published: (2024)

The Computational Advantage of MIP* Vanishes in the Presence of Noise
by: Dong, Yangjing, et al.
Published: (2023)

Computational aspects of the trace norm contraction coefficient
by: Delsol, Idris, et al.
Published: (2025)

Basic Quantum Algorithms
by: Portugal, Renato
Published: (2022)

Quantum Threshold is Powerful
by: Grier, Daniel, et al.
Published: (2024)

Uncloneable Quantum Advice
by: Broadbent, Anne, et al.
Published: (2023)

Why Philosophers Should Care About Computational Complexity
by: Aaronson, Scott
Published: (2011)

Quantum Search With Generalized Wildcards
by: Cornelissen, Arjan, et al.
Published: (2025)

Quantum Interactive Oracle Proofs
by: Sun, Baocheng, et al.
Published: (2026)

An Efficient Quantum Factoring Algorithm
by: Regev, Oded
Published: (2023)

Efficient Quantum Hermite Transform
by: Jain, Siddhartha, et al.
Published: (2025)

On the Complexity of Decoded Quantum Interferometry
by: Marwaha, Kunal, et al.
Published: (2025)

Quantum Communication Advantage in TFNP
by: Göös, Mika, et al.
Published: (2024)

On the Need for Large Quantum Depth
by: Chia, Nai-Hui, et al.
Published: (2019)