Zobrazeno 1 - 10
of 346
pro vyhledávání: '"Perkowski, Marek. A."'
The decomposition from the group theory-based methods of Sasao and Saraivanov is extended to design binary quantum cascades, using the quantum rotational gates by the X-axis (CNOT and RX), Y-axis (RY), and Z-axis (controlled-Z) of the Bloch sphere. A
Externí odkaz:
http://arxiv.org/abs/2410.19229
This paper extends the decomposition from the group theory based methods of Sasao and Saraivanov to design binary input multivalued output quantum cascades realized with optical NOT, SWAP, and Fredkin Gates. We present this method for 3, 5, and 7 val
Externí odkaz:
http://arxiv.org/abs/2410.18367
Autor:
Al-Bayaty, Ali, Perkowski, Marek
A generic Boolean-phase SWAP gate is introduced for quantum cost-effectiveness. This gate is termed the "p-SWAP", and p is a customizable phase difference between the swapped qubits, where 0 <= p <= ${\pm \pi}$ radians. The cost-effectiveness of p-SW
Externí odkaz:
http://arxiv.org/abs/2410.16641
Autor:
Al-Bayaty, Ali, Perkowski, Marek
A cost-effective n-bit Toffoli gate is proposed to be realized (or transpiled) based on the layouts (linear, T-like, and I-like) and the number of n physical qubits for IBM quantum computers. This proposed gate is termed the "layout-aware n-bit Toffo
Externí odkaz:
http://arxiv.org/abs/2410.13104
We introduce a new quantum layout-aware approach to realize cost-effective $n$-bit gates using the Bloch sphere, for $2 \le n \le 5$ qubits. These $n$-bit gates are entirely constructed from the Clifford+T gates, in the approach of selecting sequence
Externí odkaz:
http://arxiv.org/abs/2408.01025
Autor:
Al-Bayaty, Ali, Perkowski, Marek
A new methodology is proposed to solve classical Boolean problems as Hamiltonians, using the quantum approximate optimization algorithm (QAOA). Our methodology successfully finds all optimized approximated solutions for Boolean problems, after conver
Externí odkaz:
http://arxiv.org/abs/2407.07250
Autor:
Al-Bayaty, Ali1 (AUTHOR) albayaty@pdx.edu, Perkowski, Marek1 (AUTHOR)
Publikováno v:
Entropy. Oct2024, Vol. 26 Issue 10, p843. 16p.
Publikováno v:
J. Phys. A: Math. Theor. 55 (2022) 305302 (54pp)
A quantum computer can perform exponentially faster than its classical counterpart. It works on the principle of superposition. But due to the decoherence effect, the superposition of a quantum state gets destroyed by the interaction with the environ
Externí odkaz:
http://arxiv.org/abs/2204.01000
Quantum concatenation code is an effective way to realize fault-tolerant universal quantum computing. Still, there are many non-fault-tolerant logical locations at its low encoding level, which thereby increases the probability of error multiplicatio
Externí odkaz:
http://arxiv.org/abs/2105.07133
Autor:
Daraeizadeh, Sahar, Premaratne, Shavindra P., Song, Xiaoyu, Perkowski, Marek, Matsuura, Anne Y.
Publikováno v:
Phys. Rev. A 102, 012601 (2020)
We use machine learning techniques to design a 50 ns three-qubit flux-tunable controlled-controlled-phase gate with fidelity of >99.99% for nearest-neighbor coupled transmons in circuit quantum electrodynamics architectures. We explain our gate desig
Externí odkaz:
http://arxiv.org/abs/1908.01092