Zobrazeno 1 - 10
of 104
pro vyhledávání: '"Tani, Seiichiro"'
Autor:
Tani, Seiichiro
The claw problem is central in the fields of theoretical computer science as well as cryptography. The optimal quantum query complexity of the problem is known to be $\Omega\left(\sqrt{G}+(FG)^{1/3} \right)$ for input functions $f\colon [F]\to Z$ and
Externí odkaz:
http://arxiv.org/abs/2410.02243
A quantum channel whose image approximates the set of separable states is called a disentangler, which plays a prominent role in the investigation of variants of the computational model called Quantum Merlin Arthur games, and has potential applicatio
Externí odkaz:
http://arxiv.org/abs/2402.08981
Publikováno v:
npj Quantum Inf 10, 3 (2024)
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 pro
Externí odkaz:
http://arxiv.org/abs/2303.10860
The purpose of unitary synthesis is to find a gate sequence that optimally approximates a target unitary transformation. A new synthesis approach, called probabilistic synthesis, has been introduced, and its superiority has been demonstrated over tra
Externí odkaz:
http://arxiv.org/abs/2301.06307
Autor:
Tani, Seiichiro
Publikováno v:
Proc. 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022), pp. 81:1-81:15
Space-bounded computation has been a central topic in classical and quantum complexity theory. In the quantum case, every elementary gate must be unitary. This restriction makes it unclear whether the power of space-bounded computation changes by all
Externí odkaz:
http://arxiv.org/abs/2206.15122
Publikováno v:
Proceedings of the 18th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2023), pp. 9:1-9:23, 2023
We define rewinding operators that invert quantum measurements. Then, we define complexity classes ${\sf RwBQP}$, ${\sf CBQP}$, and ${\sf AdPostBQP}$ as sets of decision problems solvable by polynomial-size quantum circuits with a polynomial number o
Externí odkaz:
http://arxiv.org/abs/2206.05434
Pure quantum states are often approximately encoded as classical bit strings such as those representing probability amplitudes and those describing circuits that generate the quantum states. The crucial quantity is the minimum length of classical bit
Externí odkaz:
http://arxiv.org/abs/2111.05531
Publikováno v:
Phys. Rev. A 106, L010601 (2022)
In the seminal paper [Metger and Vidick, Quantum '21], they proposed a computational self-testing protocol for Bell states in a single quantum device. Their protocol relies on the fact that the target states are stabilizer states, and hence it is hig
Externí odkaz:
http://arxiv.org/abs/2111.02700
Publikováno v:
Quantum 6, 758 (2022)
Several noisy intermediate-scale quantum computations can be regarded as logarithmic-depth quantum circuits on a sparse quantum computing chip, where two-qubit gates can be directly applied on only some pairs of qubits. In this paper, we propose a me
Externí odkaz:
http://arxiv.org/abs/2109.14928
Publikováno v:
Phys. Rev. Research 3, 013213 (2021)
Generating ground states of any local Hamiltonians seems to be impossible in quantum polynomial time. In this paper, we give evidence for the impossibility by applying an argument used in the quantum-computational-supremacy approach. More precisely,
Externí odkaz:
http://arxiv.org/abs/2006.12125