The following pages link to Tadao Nakamura (Q479371):
Displaying 50 items.
- An additional condition for Bell experiments for accepting local realistic theories (Q479372) (← links)
- Measurement theory in Deutsch's algorithm based on the truth values (Q518781) (← links)
- Better entanglement witness for genuine multipartite entanglement (Q725606) (← links)
- New method of calculating a multiplication by using the generalized Bernstein-Vazirani algorithm (Q726023) (← links)
- Efficient quantum algorithms of finding the roots of a polynomial function (Q1616488) (← links)
- Creating very true quantum algorithms for quantum energy based computing (Q1643461) (← links)
- Quantum cryptography based on the Deutsch-Jozsa algorithm (Q1685724) (← links)
- Quantum cryptography, quantum communication, and quantum computer in a noisy environment (Q1701186) (← links)
- A classical probability space exists for the measurement theory based on the truth values (Q1708034) (← links)
- Efficient quantum algorithm for the parity problem of a certain function (Q1740738) (← links)
- Necessary and sufficient condition for quantum computing (Q1740946) (← links)
- Quantum communication based on an algorithm of determining a matrix (Q1740965) (← links)
- Quantum algorithm for determining a complex number string (Q2010995) (← links)
- Incompleteness in the Bell theorem with an arbitrary number of settings (Q2024814) (← links)
- Quantum algorithm for evaluating two of logical functions simultaneously (Q2197015) (← links)
- Generalization of Deutsch's algorithm (Q2197057) (← links)
- Quantum cryptography based on an algorithm for determining a function using qudit systems (Q2208054) (← links)
- A quantum algorithm for a FULL adder operation based on registers of the CPU in a quantum-gated computer (Q2239688) (← links)
- Physics' evolution toward computing (Q2240987) (← links)
- Can von Neumann's theory meet the Deutsch-Jozsa algorithm? (Q2268429) (← links)
- Time invariance as an additional constraint on nonlocal realism (Q2269540) (← links)
- The supposition for the Kochen and Specker theorem using sum rule and product rule (Q2280624) (← links)
- Incompleteness in the Bell theorem using non-contextual local realistic model (Q2300811) (← links)
- Some theoretically organized algorithm for quantum computers (Q2300853) (← links)
- Using inequalities as tests for the Kochen-Specker theorem for multiparticle states (Q2322119) (← links)
- The Kochen-Specker theorem based on the Kronecker delta (Q2323745) (← links)
- No-cloning theorem, Kochen-Specker theorem, and quantum measurement theories (Q2323812) (← links)
- Quantum algorithm for the root-finding problem (Q2329950) (← links)
- Kochen-Specker theorem as a precondition for quantum computing (Q2400205) (← links)
- Two symmetric measurements may cause an unforeseen effect (Q2693843) (← links)
- (Q2781871) (← links)
- (Q3072578) (← links)
- (Q3095822) (← links)
- (Q3095823) (← links)
- (Q3095834) (← links)
- (Q3108400) (← links)
- (Q3108401) (← links)
- (Q3173841) (← links)
- A fast algorithm for evaluating the matrix polynomial I+A+. . .+A/sup N-1/ (Q4017651) (← links)
- ASYNCHRONOUS MONOTONE NEWTON ITERATIVE METHOD ON DISTRIBUTED COMPUTERS (Q4377117) (← links)
- A DIVIDE-AND-INNER PRODUCT PARALLEL ALGORITHM FOR POLYNOMIAL EVALUATION (Q4820096) (← links)
- THE CONVERGENCE OF ASYNCHRONOUS ITERATIONS FOR THE FIXED POINT OF A SPLITTING OPERATOR (Q4820132) (← links)
- (Q4870090) (← links)
- A Simple Parallel Algorithm for Polynomial Evaluation (Q4870650) (← links)
- Fast parallel algorithms for vandermonde determinants (Q4950623) (← links)
- Simplified Quantum Computing with Applications (Q5060251) (← links)
- (Q5182734) (← links)
- Local realism does not impose the commutative algebraic structure into all quantum observables (Q5256530) (← links)
- Mathematical digital quantum computation by means of much more logical skills (Q6578532) (← links)
- Quantum cryptography based on an algorithm for determining simultaneously all the mappings of a Boolean function (Q6590005) (← links)
