Zobrazeno 1 - 10
of 142
pro vyhledávání: '"Suksmono, Andriyan"'
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
Publikováno v:
Phys. Rev. B 106, 155409 (2022)
We investigate spontaneous entanglement of two qubits mediated by nonreciprocal surface plasmon polaritons (SPPs) in a Weyl semimetal. In the absence of external magnetic fields, the topology of the Weyl semimetal even gives rise to nonreciprocal SPP
Externí odkaz:
http://arxiv.org/abs/2206.00534
Quantum annealing technologies aim to solve computational optimization and sampling problems. QPU (Quantum Processing Unit) machines such as the D-Wave system use the QUBO (Quadratic Unconstrained Binary Optimization) formula to define model optimiza
Externí odkaz:
http://arxiv.org/abs/2203.13469
Autor:
Wakaura, Hikaru, Suksmono, Andriyan B.
The development of Fault-Tolerant Quantum Computer (FTQC) gradually raises a possibility to implement the Quantum Phase Estimation (QPE) algorithm. However, QPE works only for normalized systems. This requires the minimum and maximum of eigenvalues o
Externí odkaz:
http://arxiv.org/abs/2111.02448
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
Autor:
Suksmono, Andriyan B., Danudirdjo, Donny, Setiawan, Antonius D., Prastio, Rizki P., Rahmawati, Dien
We have constructed an imaging device that capable to show a spatio-temporal distribution of magnetic field intensity in real-time. The device employs a set of AMR (Anisotropic Magneto Resistance) 3-axis magnetometers, which are arranged into a two-d
Externí odkaz:
http://arxiv.org/abs/1904.05620
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 B.
Let o be a 4k-length column vector whose all entries are 1s, with k a positive integer. Let V={v_i} be a set of semi-normalized Hadamard (SH)-vectors, which are 4k-length vectors whose 2k entries are -1s and the remaining 2k are 1s. We define a 4k-or
Externí odkaz:
http://arxiv.org/abs/1606.09368