The following pages link to Harumichi Nishimura (Q347105):
Displaying 48 items.
- Quantum query complexity of almost all functions with fixed on-set size (Q347109) (← links)
- Computational indistinguishability between quantum states and its cryptographic application (Q434349) (← links)
- Unbounded-error quantum query complexity (Q638526) (← links)
- Quantum counterfeit coin problems (Q714865) (← links)
- Quantum algorithms for finding constant-sized sub-hypergraphs (Q896154) (← links)
- Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families (Q1009352) (← links)
- An application of quantum finite automata to interactive proof systems (Q1015813) (← links)
- Computational complexity of uniform quantum circuit families and quantum Turing machines (Q1605308) (← links)
- Uniformity of quantum circuit families for error-free algorithms (Q1770403) (← links)
- Polynomial time quantum computation with advice (Q2390250) (← links)
- Interactive proofs with quantum finite automata (Q2513604) (← links)
- Local Transition Functions of Quantum Turing Machines (Q2720411) (← links)
- (Q2742591) (← links)
- Reconstructing Strings from Substrings with Quantum Queries (Q2904573) (← links)
- (Q2906789) (← links)
- Quantum Algorithms for Finding Constant-Sized Sub-hypergraphs (Q2920479) (← links)
- Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete (Q2954372) (← links)
- Stronger methods of making quantum interactive proofs perfectly complete (Q2986882) (← links)
- Quantum Counterfeit Coin Problems (Q3060724) (← links)
- (Q3166032) (← links)
- Quantum Algorithms for Matrix Products over Semirings (Q3188907) (← links)
- Polynomial-Time Construction of Linear Network Coding (Q3521926) (← links)
- The efficiency of quantum identity testing of multiple states (Q3531190) (← links)
- Quantum Network Coding (Q3590966) (← links)
- Quantum Query Complexity of Boolean Functions with Small On-Sets (Q3597889) (← links)
- Unbounded-Error Quantum Query Complexity (Q3597890) (← links)
- General Scheme for Perfect Quantum Network Coding with Free Classical Communication (Q3638068) (← links)
- (Q4505574) (← links)
- (Q4598146) (← links)
- (Q4598147) (← links)
- (Q4601844) (← links)
- Generalized Quantum Arthur--Merlin Games (Q4634057) (← links)
- (Q4736849) (← links)
- (Q5005126) (← links)
- (Q5090500) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311154) (← links)
- Quantum Algorithms for Matrix Products over Semirings (Q5360827) (← links)
- Computational Indistinguishability Between Quantum States and Its Cryptographic Application (Q5385734) (← links)
- Unbounded-Error Classical and Quantum Communication Complexity (Q5387749) (← links)
- Unbounded-Error One-Way Classical and Quantum Communication Complexity (Q5428802) (← links)
- Implementation and Application of Automata (Q5463983) (← links)
- RECOVERING STRINGS IN ORACLES: QUANTUM AND CLASSIC (Q5495415) (← links)
- QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES (Q5696941) (← links)
- (Q6107273) (← links)
- (Q6161152) (← links)
- Brief announcement: Distributed quantum proofs for replicated data (Q6535042) (← links)
- Distributed quantum interactive proofs (Q6615151) (← links)
- Distributed Merlin-Arthur synthesis of quantum states and its applications (Q6647696) (← links)
