Zobrazeno 1 - 10
of 279
pro vyhledávání: '"Perkowski, Marek. A."'
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
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
Previous work has provided methods for decomposing unitary matrices to series of quantum multiplexers, but the multiplexers created in this way are highly non-minimal. This paper presents a new approach for optimizing quantum multiplexers with arbitr
Externí odkaz:
http://arxiv.org/abs/1902.06229
We realize Surface Code quantum memories for nearest-neighbor qubits with always-on Ising interactions. This is done by utilizing multi-qubit gates that mimic the functionality of several gates. The previously proposed Surface Code memories rely on e
Externí odkaz:
http://arxiv.org/abs/1811.09011
In this paper we present a method for minimizing reversible quantum circuits using the Quantum Operator Form (QOF); a new representation of quantum circuit and of quantum-realized reversible circuits based on the CNOT, CV and CV$^\dagger$ quantum gat
Externí odkaz:
http://arxiv.org/abs/1701.01999
Autor:
Schaeffer, Ben, Perkowski, Marek
This paper presents a heuristic cost minimization approach to synthesizing linear reversible circuits. Two bidirectional linear reversible circuit synthesis methods are introduced, the Alternating Elimination with Cost Minimization method (AECM) and
Externí odkaz:
http://arxiv.org/abs/1407.0070
It has been experimentally proven that realizing universal quantum gates using higher-radices logic is practically and technologically possible. We developed a Parallel Genetic Algorithm that synthesizes Boolean reversible circuits realized with a va
Externí odkaz:
http://arxiv.org/abs/1107.3383