9 citations · 36 across the 8 of their papers we have counts for
9 papers
Divide-and-conquer verification method for noisy intermediate-scale quantum computation
Yuki Takeuchi, Yasuhiro Takahashi, Tomoyuki Morimae +1
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 directl…
Hardness of efficiently generating ground states in postselected quantum computation
Yuki Takeuchi, Yasuhiro Takahashi, Seiichiro Tani
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…
Classically Simulating Quantum Circuits with Local Depolarizing Noise
Yasuhiro Takahashi, Yuki Takeuchi, Seiichiro Tani
We study the effect of noise on the classical simulatability of quantum circuits defined by computationally tractable (CT) states and efficiently computable sparse (ECS) operations…
Ancilla-driven instantaneous quantum polynomial time circuit for quantum supremacy
Yuki Takeuchi, Yasuhiro Takahashi
Instantaneous quantum polynomial time (IQP) is a model of (probably) non-universal quantum computation. Since it has been proven that IQP circuits are unlikely to be simulated clas…
Power of Uninitialized Qubits in Shallow Quantum Circuits
Yasuhiro Takahashi, Seiichiro Tani
We study the computational power of shallow quantum circuits with initialized and uninitialized ancillary qubits, where is the input length and the initi…
Commuting Quantum Circuits with Few Outputs are Unlikely to be Classically Simulatable
Yasuhiro Takahashi, Seiichiro Tani, Takeshi Yamazaki +1
We study the classical simulatability of commuting quantum circuits with n input qubits and O(log n) output qubits, where a quantum circuit is classically simulatable if its output…
Collapse of the Hierarchy of Constant-Depth Exact Quantum Circuits
Yasuhiro Takahashi, Seiichiro Tani
We study the quantum complexity class QNC^0_f of quantum operations implementable exactly by constant-depth polynomial-size quantum circuits with unbounded fan-out gates (called QN…
Simple Sets of Measurements for Universal Quantum Computation and Graph State Preparation
Yasuhiro Takahashi
We consider the problem of minimizing resources required for universal quantum computation using only projective measurements. The resources we focus on are observables, which desc…
Quantum Addition Circuits and Unbounded Fan-Out
Yasuhiro Takahashi, Seiichiro Tani, Noboru Kunihiro
We first show how to construct an O(n)-depth O(n)-size quantum circuit for addition of two n-bit binary numbers with no ancillary qubits. The exact size is 7n-6, which is smaller t…