Tadao Nakamura

From MaRDI portal
Person:479371

Available identifiers

zbMath Open nakamura.tadaoMaRDI QIDQ479371

List of research outcomes





PublicationDate of PublicationType
Generalization of the Bernstein-Vazirani algorithm beyond qubit systems2024-08-21Paper
Quantum cryptography based on an algorithm for determining simultaneously all the mappings of a Boolean function2024-08-21Paper
Mathematical digital quantum computation by means of much more logical skills2024-07-25Paper
Two symmetric measurements may cause an unforeseen effect2023-03-24Paper
Simplified Quantum Computing with Applications2023-01-09Paper
A quantum algorithm for a FULL adder operation based on registers of the CPU in a quantum-gated computer2021-11-05Paper
Physics' evolution toward computing2021-11-05Paper
Incompleteness in the Bell theorem with an arbitrary number of settings2021-05-04Paper
Quantum cryptography based on an algorithm for determining a function using qudit systems2020-10-23Paper
Quantum algorithm for evaluating two of logical functions simultaneously2020-09-04Paper
Generalization of Deutsch's algorithm2020-09-04Paper
Incompleteness in the Bell theorem using non-contextual local realistic model2020-02-28Paper
Some theoretically organized algorithm for quantum computers2020-02-28Paper
The supposition for the Kochen and Specker theorem using sum rule and product rule2019-12-19Paper
Quantum algorithm for determining a complex number string2019-11-28Paper
Quantum algorithm for the root-finding problem2019-10-18Paper
The Kochen-Specker theorem based on the Kronecker delta2019-09-03Paper
No-cloning theorem, Kochen-Specker theorem, and quantum measurement theories2019-09-03Paper
Using inequalities as tests for the Kochen-Specker theorem for multiparticle states2019-09-03Paper
Efficient quantum algorithm for the parity problem of a certain function2019-05-03Paper
Necessary and sufficient condition for quantum computing2019-05-03Paper
Quantum communication based on an algorithm of determining a matrix2019-05-03Paper
Efficient quantum algorithms of finding the roots of a polynomial function2018-11-06Paper
New method of calculating a multiplication by using the generalized Bernstein-Vazirani algorithm2018-08-02Paper
Better entanglement witness for genuine multipartite entanglement2018-08-01Paper
Creating very true quantum algorithms for quantum energy based computing2018-06-19Paper
A classical probability space exists for the measurement theory based on the truth values2018-04-04Paper
Quantum cryptography, quantum communication, and quantum computer in a noisy environment2018-02-22Paper
Quantum cryptography based on the Deutsch-Jozsa algorithm2017-12-19Paper
Kochen-Specker theorem as a precondition for quantum computing2017-08-28Paper
Measurement theory in Deutsch's algorithm based on the truth values2017-03-30Paper
Local realism does not impose the commutative algebraic structure into all quantum observables2015-06-18Paper
An additional condition for Bell experiments for accepting local realistic theories2014-12-05Paper
https://portal.mardi4nfdi.de/entity/Q31084002012-01-03Paper
https://portal.mardi4nfdi.de/entity/Q31084012012-01-03Paper
https://portal.mardi4nfdi.de/entity/Q30958232011-11-04Paper
https://portal.mardi4nfdi.de/entity/Q30958222011-11-04Paper
https://portal.mardi4nfdi.de/entity/Q30958342011-11-04Paper
https://portal.mardi4nfdi.de/entity/Q31738412011-10-10Paper
Reformulation of Max Born's theory for information science2011-02-04Paper
Time invariance as an additional constraint on nonlocal realism2010-03-17Paper
Can von Neumann's theory meet the Deutsch-Jozsa algorithm?2010-03-08Paper
A DIVIDE-AND-INNER PRODUCT PARALLEL ALGORITHM FOR POLYNOMIAL EVALUATION2004-10-06Paper
THE CONVERGENCE OF ASYNCHRONOUS ITERATIONS FOR THE FIXED POINT OF A SPLITTING OPERATOR2004-10-06Paper
https://portal.mardi4nfdi.de/entity/Q27818712002-07-02Paper
Fast parallel algorithms for vandermonde determinants2001-11-29Paper
ASYNCHRONOUS MONOTONE NEWTON ITERATIVE METHOD ON DISTRIBUTED COMPUTERS1998-02-09Paper
https://portal.mardi4nfdi.de/entity/Q48700901996-09-05Paper
A Simple Parallel Algorithm for Polynomial Evaluation1996-03-27Paper
A fast algorithm for evaluating the matrix polynomial I+A+. . .+A/sup N-1/1993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q51827341967-01-01Paper

Research outcomes over time

This page was built for person: Tadao Nakamura