IEEE Conference on Decision and Control (CDC)

On the generation of discrete unitary gates from continuous time forced Schrodinger equations

Claudio Altafini

Published Aug 27, 2003• 1 citation

Abstract

In all the various proposals for quantum computers, a common feature is that the quantum circuits are expected to be made of cascades of unitary transformations acting on the quantum states. A framework is proposed to express these elementary quantum gates directly in terms of the control inputs entering into the continuous time forced Schrodinger equation.

DOI: 10.1109/cdc.2002.1184538

Related papers

On the generation of sequential unitary gates from continuous time Schrodinger equations driven by external fields

Claudio Altafini

arXiv:quant-ph/0203005Mar 2, 20024 citations

On the generation of elementary quantum gates from continuous time forced Schrodinger equation

Claudio Altafini

Jan 1, 20020 citations

Continuous and discrete frames generated by the evolution flow of the Schrödinger equation

Giovanni S. Alberti, Stephan Dahlke, Filippo De Mari +2 more

We study a family of coherent states, called Schrödingerlets, both in the continuous and discrete setting. They are defined in terms of the Schrödinger equation of a free quantum particle and some of its invariant transformations.

arXiv:1510.04547Analysis and ApplicationsJan 23, 20171 citation

On the Generation of Sequential Unitary Gates from Continuous Time Schrödinger Equations Driven by External Fields

Claudio Altafini

Quantum Information ProcessingJun 1, 200218 citations

Quantum circuit design of 8 /spl times/ 8 discrete Hartley transform

Chien‐Cheng Tseng, Tsung-Ming Hwang

In this paper, the 8 /spl times/ 8 discrete Hartley transform will be implemented by using quantum elementary gates such as controlled NOT gates and Hadamard gates. Two steps involved are as follows: first, the discrete Hartley transform matrix is decomposed into the product of several sparse unitary matrices using the structure of fast Hartley transform algorithm. Then, each sparse matrix is implemented by elementary quantum gates and cascade them to obtain the final circuit. The design results show that the proposed design method has less circuit complexity than the conventional Cybenko's method.

IEEE International Symposium on Circuits and Systems proceedingsJan 1, 200410 citations

Self-Referential Quantum Circuits for Universal Computation

Jincheng Zhang

This paper explores a novel approach to quantum computation centered around self-referential quantum circuits. The core concept involves designing circuits that recursively incorporate themselves into their operational structure, effectively creating computational modules capable of self-replication. This is achieved through the strategic implementation of feedback loops and entanglement within the circuit architecture. The potential benefits of this paradigm include a reduction in circuit complexity and the possibility of constructing universal quantum computers from fundamentally simpler components. The theoretical framework presented herein outlines the key principles and mathematical underpinnings of this self-referential design, proposing a pathway toward more efficient and scalable quantum computation. The presented model uses the following notation: |ψ⟩ represents a quantum state, U(θ) represents a unitary operator with rotation angle θ, C represents a quantum circuit, and E represents the expectation value. Specifically, the expectation value of an observable A is denoted as E[A] = <ψ|A|ψ>, where |ψ> is the quantum state. The Hamiltonian of a quantum system is typically represented as H, and the time evolution of the state is governed by the Schrödinger equation: iℏ∂|ψ(t)⟩/∂t = H|ψ(t)⟩. Entanglement is represented by the Bell state |Φ⁺⟩ = (|00⟩ + |11⟩)/√2. Quantum gates, such as the Hadamard gate (H) and the CNOT gate (CN), are represented as unitary transformations. The circuit representation involves sequential application of gates, and the overall unitary transformation is the product of these gates. The circuit depth, denoted as d, represents the number of consecutive gate operations applied to a quantum state. The circuit complexity, denoted as C, is a measure of the number of gates required to implement a specific quantum algorithm. The circuit fidelity, denoted as F, quantifies the accuracy of a quantum circuit's output, ranging from 0 to 1. We define the quantum state preparation as |ψ⟩ = ∑i ci|i⟩, where ci are complex coefficients and |i⟩ are the computational basis states. The unitary transformation is defined as U|ψ⟩ = ∑i (Uici)|i⟩, where Ui are the matrix elements of the unitary operator U. The propagation of quantum states through a circuit is represented by the Schrödinger equation, and the final state is obtained by applying the unitary transformation to the initial state. The concept of quantum coherence, denoted as χ, represents the ability of a quantum system to maintain its superposition state. The fidelity of a quantum state is defined as the probability that a measurement will yield the expected outcome.

Sep 4, 20260 citations