Zobrazeno 1 - 10
of 86
pro vyhledávání: '"Suksmono, Andriyan Bayu"'
Autor:
Suksmono, Andriyan Bayu
Finding a Hadamard matrix of a specific order using a quantum computer can lead to a demonstration of practical quantum advantage. Earlier efforts using a quantum annealer were impeded by the limitations of the present quantum resource and its capabi
Externí odkaz:
http://arxiv.org/abs/2408.07964
Recently there are more promising qubit technology such as Majorana fermions Rydberg atoms and Silicon quantum dot have yet to be developed for realizing a quantum computer than Superconductivity and Ion trap into the world The simulation of the quan
Externí odkaz:
http://arxiv.org/abs/2312.16432
Observing rapid developments of both the number of qubits and quantum volume, especially with recent advances in ion-trap quantum computers, it is no doubt that Fault-Tolerant-Quantum-Computer (FTQC) will be realized in the near future. Since FTQC re
Externí odkaz:
http://arxiv.org/abs/2105.01141
Solving hard problems is one of the most important issues in computing to be addressed by a quantum computer. Previously, we have shown that the H-SEARCH; which is the problem of finding a Hadamard matrix (H-matrix) among all possible binary matrices
Externí odkaz:
http://arxiv.org/abs/2009.10919
Finding a Hadamard matrix (H-matrix) among the set of all binary matrices of corresponding order is a hard problem, which potentially can be solved by quantum computing. We propose a method to formulate the Hamiltonian of finding H-matrix problem and
Externí odkaz:
http://arxiv.org/abs/1902.07890
Autor:
Suksmono, Andriyan Bayu
Reformulation of a combinatorial problem into optimization of a statistical-mechanics system, enables finding a better solution using heuristics derived from a physical process, such as by the SA (Simulated Annealing). In this paper, we present a Had
Externí odkaz:
http://arxiv.org/abs/1606.03815
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Suksmono, Andriyan Bayu
We propose a simple solution to the uncertain delay problem in USRP (Universal Software Radio Peripheral)-based SDR (Software-Defined Radio)-radar systems. Instead of time-synchronization as employed in (pseudo-) passive radar configurations, which r
Externí odkaz:
http://arxiv.org/abs/1309.4843
Autor:
Suksmono, Andriyan Bayu
This paper proposes a new fBm (fractional Brownian motion) interpolation/reconstruction method from partially known samples based on CS (Compressive Sampling). Since 1/f property implies power law decay of the fBm spectrum, the fBm signals should be
Externí odkaz:
http://arxiv.org/abs/1105.5924
Autor:
Suksmono, Andriyan Bayu
A method to improve l1 performance of the CS (Compressive Sampling) for A-scan SFCW-GPR (Stepped Frequency Continuous Wave-Ground Penetrating Radar) signals with known spectral energy density is proposed. Instead of random sampling, the proposed meth
Externí odkaz:
http://arxiv.org/abs/0904.1910