Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE

Toward a model for multi-qubit quantum memory

Tai Tsun Wu

Published May 25, 2005• 2 citations
Publisher

Abstract

To a large extent, the power of a quantum computer comes from the possibility of operating on a number of quantum memories simultaneously. For example, if there are n linearly independent quantum states in each of N quantum memories, then the number of linearly independent quantum states is n^N when they are taken together. This exponential increase is the basis of the present interest in quantum computing. In the context of quantum mechanics as described by the Schrodinger equation (which is a partial differential equation), the most explicit model of the quantum memory is one with two linearly independent quantum states described in terms of the Fermi pseudo-potential at one point. In this model, operations on the quantum memory are accomplished through scattering with both symmetrical and anti-symmetrical incident waves. As a first step toward operating on more than one quantum memory, this model is generalized in two directions. (1) With the Fermi pseudo-potential at one point retained, three linearly independent quantum states are used for the quantum memory. This model of the quantum memory requires three external connections. (2) With a more general potential, operations on the quantum memory with two states are accomplished through scattering with either symmetrical or anti-symmetrical incident waves. This second generalization is important because it is not practical to keep the number of external connections equal to the number of linearly independent quantum states.

DOI
10.1117/12.603586

Related papers

Quantum memory: write, read, reset, and decoherence

Tai Tsun Wu

An essential component of any quantum computer is the quantum memory, the content of which is a pure quantum state. A program to study the quantum memory is initiated here, where the spatial variables are of central importance. The presence of the spatial variables makes it possible to apply the powerful and well-developed theory of scattering: The fundamental operations of writing on, reading and resetting the quantum memory are all performed through scattering from the memory. The requirement that the quantum memory must remain in a pure state after scattering implies that the scattering is of a special type, and only certain incident waves are admissible. Models based on the coupled-channel Schrodinger equation for potential scattering are formulated, where there is indeed the required large collection of admissible incident waves. On the basis of these models, certain types of decoherence are unavoidable. Such decoherence and the necessity of using the relativistic Schrodinger equation are discussed. One of the implications of quantum memory is the possible lack of security for the quantum key distribution in quantum cryptography.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Aug 5, 2003•2 citations

Chapter 23: Quantum Computing

Peter Michael Kogge

Quantum computing involves performing computations using devices that are governed by the rules of quantum mechanics170 rather than classical Newtonian physics. The effect of such a difference runs deep. First, and definitely unconventional, a quantum device’s state need not be a single value at a time, but can simultaneously hold an infinite number of possible state values. Next, much like the magnets of the Ising computing model (Chapter E11), if initialized properly, two or more quantum devices may exhibit quantum entanglement where a quantum state of any one device cannot be described independently of the others in the group. Manipulating one device results in changes to the state of the others. Together this means that a “quantum memory” can simultaneously contain an enormous number of different possible values and that applying a single operation to the group is like applying the operation to the ensemble of all states maintained in the system, simultaneously. If this becomes practical then the crystal ball analogy for NP problems (Section 7.5.4) becomes practical in polynomial time, and thus we would have achieved what is called today quantum supremacy.

Society for Industrial and Applied Mathematics eBooks•Jan 1, 2022•0 citations

Theory and application of Fermi pseudo-potential in one dimension

Tai Tsun Wu, Ming Lun Yu

The theory of interaction at one point is developed for the one-dimensional Schrödinger equation. In analog with the three-dimensional case, the resulting interaction is referred to as the Fermi pseudo-potential. The dominant feature of this one-dimensional problem comes from the fact that the real line becomes disconnected when one point is removed. The general interaction at one point is found to be the sum of three terms, the well-known delta-function potential and two Fermi pseudo-potentials, one odd under space reflection and the other even. The odd one gives the proper interpretation for the δ′(x) potential, while the even one is unexpected and more interesting. Among the many applications of these Fermi pseudo-potentials, the simplest one is described. It consists of a superposition of the delta-function potential and the even pseudo-potential applied to two-channel scattering. This simplest application leads to a model of the quantum memory, an essential component of any quantum computer.

arXiv:math-ph/0208030•Journal of Mathematical Physics•Nov 25, 2002•19 citations

Quantum Memory Multiple Access

Ankit Sharma, Manisha J Nen

Quantum is an emerging technology with constant research efforts in its various fields. One of the distinct advantage with the quantum technology is the use of qubits which gives inherent parallelism and security. However, at the same time qubits poses unique challenges due to their quantum properties. Quantum computation can further be enhanced with the use of quantum memory. In this paper we propose a technique to access stored quantum state multiple times or by multiple users at same instance.

International Conference on Computational Intelligence and Communication Technologies (CCICT)•Jul 1, 2021•2 citations

Quantum computation

Stephen Mark Barnett

In the preceding chapter we established that a suitable set of quantum gates, complemented by quantum error correction, allows us to produce a desired multiqubit unitary transformation. This transformation is one of the three steps in a quantum computation; the others, of course, are the preparation of the qubits in their initial state and the measurement of them after the transformation has been implemented. A quantum computation is designed to solve a problem or class of problems. The power of quantum computers is that they can do this, at least for some problems, very much more efficiently and quickly than any conventional computer based on classical logic operations. If we can build a quantum computer then a number of important problems which are currently intractable will become solvable. The potential for greatly enhanced computational power is, in itself, reason enough to study quantum computers, but there is another. Moore’s law is the observation that the number of transistors on a chip doubles roughly every eighteen months. A simple corollary is that computer performance also doubles on the same timescale. Associated with this exponential improvement is a dramatic reduction in the size of individual components. If the pace is to be kept up then it is inevitable that quantum effects will become increasingly important and ultimately will limit the operation of the computer. In these circumstances it is sensible to consider the possibility of harnessing quantum effects to realize quantum information processors and computers. We start with a brief introduction to the theory of computer science, the principles of which underlie the operation of what we shall refer to as classical computers. These include all existing machines and any based on the manipulation of classical bits. The development of computer science owes much to Turing, who devised a simple but powerful model of a computing device: the Turing machine. It its most elementary form, this consists of four elements. (i) A tape for data storage, which acts as a memory. This tape has a sequence of spaces, each of which has on it one of a finite set of symbols. (ii) A processor, which controls the operations of the machine.

Oxford University Press eBooks•May 28, 2009•0 citations

Efficient Pauli-decomposition and multistage state-refinement for tensor network based differential equation solver

Vishwabhushan Suresh Gholap, Himadri Shekhar Dhar, Siddhartha Santra

Classical numerical techniques for solving partial differential equations (PDEs) become computationally expensive as the dimension of the discretized differential operator increases. For PDEs giving rise to Sturm--Liouville problems, tensor network (TN) methods can be highly productive: an operator of dimension $N\times N$ can be represented as a matrix product operator (MPO) using only $n=\log_2(N)$ qubits, enabling computation of eigenvalues and eigenvectors via imaginary time evolution (ITE). However, this remains computationally challenging. First, most methods for generating MPOs of large operators without explicit tensor-product structure require prohibitively large memory. Second, the number of Trotterization steps for convergence in conventional ITE increases rapidly with $n$. We present techniques to mitigate both challenges for certain sparse, structured differential operators. To address the first, we construct the MPO by expanding the operator in the Pauli-string basis, enabled by an analytical expression for the Pauli basis coefficients that reduces the memory requirement from $\mathcal{O}(2^{n+1})$ to $\mathcal{O}(2n)$. To address the second, we propose a multistage state-refinement heuristic that accelerates ITE convergence, reducing convergence time by up to two orders of magnitude. Using this TN framework, we compute the first 32 eigenstates of a Laplacian of dimension exceeding $10^6$ with fidelity above $0.95$ using a 20-qubit MPO. We further validate the method on the 2D anharmonic oscillator and investigate disordered systems, where increasing random potential strength degrades accuracy and limits the approach.

quant-pharXiv:2607.08166•Jul 10, 2026•0 citations
To a large extent, the power of a quantum computer comes from the possibility of operating on a number of quantum memories simultaneously. For example, if there are n linearly independent quantum states in each of N quantum memories, then the number of linearly independent quantum states is n^N when they are taken together. This exponential increase is the basis of the present interest in quantum computing. In the context of quantum mechanics as described by the Schrodinger equation (which is a partial differential equation), the most explicit model of the quantum memory is one with two linearly independent quantum states described in terms of the Fermi pseudo-potential at one point. In this model, operations on the quantum memory are accomplished through scattering with both symmetrical and anti-symmetrical incident waves. As a first step toward operating on more than one quantum memory, this model is generalized in two directions. (1) With the Fermi pseudo-potential at one point retained, three linearly independent quantum states are used for the quantum memory. This model of the quantum memory requires three external connections. (2) With a more general potential, operations on the quantum memory with two states are accomplished through scattering with either symmetrical or anti-symmetrical incident waves. This second generalization is important because it is not practical to keep the number of external connections equal to the number of linearly independent quantum states.
An essential component of any quantum computer is the quantum memory, the content of which is a pure quantum state. A program to study the quantum memory is initiated here, where the spatial variables are of central importance. The presence of the spatial variables makes it possible to apply the powerful and well-developed theory of scattering: The fundamental operations of writing on, reading and resetting the quantum memory are all performed through scattering from the memory. The requirement that the quantum memory must remain in a pure state after scattering implies that the scattering is of a special type, and only certain incident waves are admissible. Models based on the coupled-channel Schrodinger equation for potential scattering are formulated, where there is indeed the required large collection of admissible incident waves. On the basis of these models, certain types of decoherence are unavoidable. Such decoherence and the necessity of using the relativistic Schrodinger equation are discussed. One of the implications of quantum memory is the possible lack of security for the quantum key distribution in quantum cryptography.
Quantum computing involves performing computations using devices that are governed by the rules of quantum mechanics170 rather than classical Newtonian physics. The effect of such a difference runs deep. First, and definitely unconventional, a quantum device’s state need not be a single value at a time, but can simultaneously hold an infinite number of possible state values. Next, much like the magnets of the Ising computing model (Chapter E11), if initialized properly, two or more quantum devices may exhibit quantum entanglement where a quantum state of any one device cannot be described independently of the others in the group. Manipulating one device results in changes to the state of the others. Together this means that a “quantum memory” can simultaneously contain an enormous number of different possible values and that applying a single operation to the group is like applying the operation to the ensemble of all states maintained in the system, simultaneously. If this becomes practical then the crystal ball analogy for NP problems (Section 7.5.4) becomes practical in polynomial time, and thus we would have achieved what is called today quantum supremacy.
The theory of interaction at one point is developed for the one-dimensional Schrödinger equation. In analog with the three-dimensional case, the resulting interaction is referred to as the Fermi pseudo-potential. The dominant feature of this one-dimensional problem comes from the fact that the real line becomes disconnected when one point is removed. The general interaction at one point is found to be the sum of three terms, the well-known delta-function potential and two Fermi pseudo-potentials, one odd under space reflection and the other even. The odd one gives the proper interpretation for the δ′(x) potential, while the even one is unexpected and more interesting. Among the many applications of these Fermi pseudo-potentials, the simplest one is described. It consists of a superposition of the delta-function potential and the even pseudo-potential applied to two-channel scattering. This simplest application leads to a model of the quantum memory, an essential component of any quantum computer.
Quantum is an emerging technology with constant research efforts in its various fields. One of the distinct advantage with the quantum technology is the use of qubits which gives inherent parallelism and security. However, at the same time qubits poses unique challenges due to their quantum properties. Quantum computation can further be enhanced with the use of quantum memory. In this paper we propose a technique to access stored quantum state multiple times or by multiple users at same instance.
In the preceding chapter we established that a suitable set of quantum gates, complemented by quantum error correction, allows us to produce a desired multiqubit unitary transformation. This transformation is one of the three steps in a quantum computation; the others, of course, are the preparation of the qubits in their initial state and the measurement of them after the transformation has been implemented. A quantum computation is designed to solve a problem or class of problems. The power of quantum computers is that they can do this, at least for some problems, very much more efficiently and quickly than any conventional computer based on classical logic operations. If we can build a quantum computer then a number of important problems which are currently intractable will become solvable. The potential for greatly enhanced computational power is, in itself, reason enough to study quantum computers, but there is another. Moore’s law is the observation that the number of transistors on a chip doubles roughly every eighteen months. A simple corollary is that computer performance also doubles on the same timescale. Associated with this exponential improvement is a dramatic reduction in the size of individual components. If the pace is to be kept up then it is inevitable that quantum effects will become increasingly important and ultimately will limit the operation of the computer. In these circumstances it is sensible to consider the possibility of harnessing quantum effects to realize quantum information processors and computers. We start with a brief introduction to the theory of computer science, the principles of which underlie the operation of what we shall refer to as classical computers. These include all existing machines and any based on the manipulation of classical bits. The development of computer science owes much to Turing, who devised a simple but powerful model of a computing device: the Turing machine. It its most elementary form, this consists of four elements. (i) A tape for data storage, which acts as a memory. This tape has a sequence of spaces, each of which has on it one of a finite set of symbols. (ii) A processor, which controls the operations of the machine.
Classical numerical techniques for solving partial differential equations (PDEs) become computationally expensive as the dimension of the discretized differential operator increases. For PDEs giving rise to Sturm--Liouville problems, tensor network (TN) methods can be highly productive: an operator of dimension N×NN\times NN×N can be represented as a matrix product operator (MPO) using only n=log⁡2(N)n=\log_2(N)n=log2​(N) qubits, enabling computation of eigenvalues and eigenvectors via imaginary time evolution (ITE). However, this remains computationally challenging. First, most methods for generating MPOs of large operators without explicit tensor-product structure require prohibitively large memory. Second, the number of Trotterization steps for convergence in conventional ITE increases rapidly with nnn. We present techniques to mitigate both challenges for certain sparse, structured differential operators. To address the first, we construct the MPO by expanding the operator in the Pauli-string basis, enabled by an analytical expression for the Pauli basis coefficients that reduces the memory requirement from O(2n+1)\mathcal{O}(2^{n+1})O(2n+1) to O(2n)\mathcal{O}(2n)O(2n). To address the second, we propose a multistage state-refinement heuristic that accelerates ITE convergence, reducing convergence time by up to two orders of magnitude. Using this TN framework, we compute the first 32 eigenstates of a Laplacian of dimension exceeding 10610^6106 with fidelity above 0.950.950.95 using a 20-qubit MPO. We further validate the method on the 2D anharmonic oscillator and investigate disordered systems, where increasing random potential strength degrades accuracy and limits the approach.