Quantum computing (QC) is expected to extend the high performance computing roadmap [1]-[2] at the condition to be able to run a large number of errorless quantum operations, typically. over a billion. It is out of reach in actual physical systems because of the quantum decoherence. As a consequence, quantum error correction techniques, which utilize the idea of redundant encoding, have been introduced to cure for the errors [3]-[5]. In state-of-the-art codes, with error thresholds or fidelities around 10-2in Si spin qubits, it is expected that logical qubits will be made out of a few thousands or more of physical qubits [6], bringing the number of required physical qubits to perform relevant quantum calculations to at least a million.Quantum computing (QC) is expected to extend the high performance computing roadmap [1]-[2] at the condition to be able to run a large number of errorless quantum operations, typically. over a billion. It is out of reach in actual physical systems because of the quantum decoherence. As a consequence, quantum error correction techniques, which utilize the idea of redundant encoding, have been introduced to cure for the errors [3]-[5]. In state-of-the-art codes, with error thresholds or fidelities around 10-2in Si spin qubits, it is expected that logical qubits will be made out of a few thousands or more of physical qubits [6], bringing the number of required physical qubits to perform relevant quantum calculations to at least a million.

Symposium on VLSI TechnologyJun 1, 20197 citations

Quantum Computation and Spin Electronics

David Peter Divincenzo, Guido Burkard, Daniel Loss +1 more

arXiv:cond-mat/9911245Springer eBooksJan 1, 200024 citations

Optimal Boolean Logic Quantum Circuit Decomposition for Spin-Torque-Based $\boldsymbol{n}$ -Qubit ArchitectureOptimal Boolean Logic Quantum Circuit Decomposition for Spin-Torque-Based $\boldsymbol{n}$ -Qubit Architecture

Anant Aravind Kulkarni, Sanjay Prajapati, Shivam Verma +1 more

The semiconductor industry is facing a twofold challenge at sub-nanometer level; first, the high power dissipation in irreversible computing architectures due to information loss and second, inability to handle large data due to sequential information processing. These issues create obstacles in producing the presumed low-power complex computing outcomes. The heat dissipation can be reduced by utilizing the complementary metal-oxide-semiconductor-based reversible computing architectures. However, these architectures fail to enhance the performance owing to inability to process large data. Quantum computing (QC) can circumvent these problems due to its fundamental ineffaceable characteristics of quantum mechanics-based reversible computing and parallelism. Spin-torque-based physical realization is the most suitable platform for reversible computing due to the electron spin analogous to the qubit. However, optimal quantum circuits are required to physically realize the complex Boolean logic due to spin-qubit decoherence and reduce the number of transistor switching activities for the spin generation and injection required for the spin-qubit rotation. Therefore, in this paper, optimal quantum circuit decompositions are presented with the help of developed elementary quantum library {Ry(θ), Rz(θ), √SWAP for the spin-torque-based QC architecture. The reversible Boolean logic performance is analyzed and compared for the conventional, reduced, and optimal decompositions on the first- and second-order transmission coefficient matrix-based spin-torque QC architecture. The results encourage to set a path toward QC-based reconfigurable complex computing systems in near future.The semiconductor industry is facing a twofold challenge at sub-nanometer level; first, the high power dissipation in irreversible computing architectures due to information loss and second, inability to handle large data due to sequential information processing. These issues create obstacles in producing the presumed low-power complex computing outcomes. The heat dissipation can be reduced by utilizing the complementary metal-oxide-semiconductor-based reversible computing architectures. However, these architectures fail to enhance the performance owing to inability to process large data. Quantum computing (QC) can circumvent these problems due to its fundamental ineffaceable characteristics of quantum mechanics-based reversible computing and parallelism. Spin-torque-based physical realization is the most suitable platform for reversible computing due to the electron spin analogous to the qubit. However, optimal quantum circuits are required to physically realize the complex Boolean logic due to spin-qubit decoherence and reduce the number of transistor switching activities for the spin generation and injection required for the spin-qubit rotation. Therefore, in this paper, optimal quantum circuit decompositions are presented with the help of developed elementary quantum library {Ry(θ), Rz(θ), √SWAP for the spin-torque-based QC architecture. The reversible Boolean logic performance is analyzed and compared for the conventional, reduced, and optimal decompositions on the first- and second-order transmission coefficient matrix-based spin-torque QC architecture. The results encourage to set a path toward QC-based reconfigurable complex computing systems in near future.

IEEE Transactions on MagneticsSep 3, 20185 citations

Quantum computation and spin manipulation

Antoon Hendrik Hams

Jan 1, 20020 citations

Quantum Computation and Quantum Spin Dynamics

Hans A. De Raedt, Kristel F. L. Michielsen, Anthony Hams +2 more

We analyze the stability of quantum computations on physically realizable quantum computers by simulating quantum spin models representing quantum computer hardware. Examples of logically identical implementations of the controlled-NOT operation are used to demonstrate that the results of a quantum computation are unstable with respect to the physical realization of the quantum computer. We discuss the origin of these instabilities and discuss possibilities to overcome this, for practical purposes, fundamental limitation of quantum computers.We analyze the stability of quantum computations on physically realizable quantum computers by simulating quantum spin models representing quantum computer hardware. Examples of logically identical implementations of the controlled-NOT operation are used to demonstrate that the results of a quantum computation are unstable with respect to the physical realization of the quantum computer. We discuss the origin of these instabilities and discuss possibilities to overcome this, for practical purposes, fundamental limitation of quantum computers.

Physics Letters ADec 1, 20010 citations

Optimal Boolean Logic Quantum Circuit Decomposition for Spin-Torque-Based

\boldsymbol{n}

-Qubit Architecture