Natural quantum reservoir computing for temporal information processing.
Ontology highlight
ABSTRACT:
SUBMITTER: Suzuki Y
PROVIDER: S-EPMC8789868 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:Reservoir computing systems utilize dynamic reservoirs having short-term memory to project features from the temporal inputs into a high-dimensional feature space. A readout function layer can then effectively analyze the projected features for tasks, such as classification and time-series analysis. The system can efficiently compute complex and temporal data with low-training cost, since only the readout function needs to be trained. Here we experimentally implement a reservoir computing system using a dynamic memristor array. We show that the internal ionic dynamic processes of memristors allow the memristor-based reservoir to directly process information in the temporal domain, and demonstrate that even a small hardware system with only 88 memristors can already be used for tasks, such as handwritten digit recognition. The system is also used to experimentally solve a second-order nonlinear task, and can successfully predict the expected output without knowing the form of the original dynamic transfer function.
| S-EPMC5736649 | biostudies-literature
Project description:Reservoir computing is a highly efficient network for processing temporal signals due to its low training cost compared to standard recurrent neural networks, and generating rich reservoir states is critical in the hardware implementation. In this work, we report a parallel dynamic memristor-based reservoir computing system by applying a controllable mask process, in which the critical parameters, including state richness, feedback strength and input scaling, can be tuned by changing the mask length and the range of input signal. Our system achieves a low word error rate of 0.4% in the spoken-digit recognition and low normalized root mean square error of 0.046 in the time-series prediction of the Hénon map, which outperforms most existing hardware-based reservoir computing systems and also software-based one in the Hénon map prediction task. Our work could pave the road towards high-efficiency memristor-based reservoir computing systems to handle more complex temporal tasks in the future.
| S-EPMC7814066 | biostudies-literature
Project description:Chunking is the process by which frequently repeated segments of temporal inputs are concatenated into single units that are easy to process. Such a process is fundamental to time-series analysis in biological and artificial information processing systems. The brain efficiently acquires chunks from various information streams in an unsupervised manner; however, the underlying mechanisms of this process remain elusive. A widely-adopted statistical method for chunking consists of predicting frequently repeated contiguous elements in an input sequence based on unequal transition probabilities over sequence elements. However, recent experimental findings suggest that the brain is unlikely to adopt this method, as human subjects can chunk sequences with uniform transition probabilities. In this study, we propose a novel conceptual framework to overcome this limitation. In this process, neural networks learn to predict dynamical response patterns to sequence input rather than to directly learn transition patterns. Using a mutually supervising pair of reservoir computing modules, we demonstrate how this mechanism works in chunking sequences of letters or visual images with variable regularity and complexity. In addition, we demonstrate that background noise plays a crucial role in correctly learning chunks in this model. In particular, the model can successfully chunk sequences that conventional statistical approaches fail to chunk due to uniform transition probabilities. In addition, the neural responses of the model exhibit an interesting similarity to those of the basal ganglia observed after motor habit formation.
| S-EPMC6193738 | biostudies-literature
Project description:Singlet fission is a photoconversion process that generates a doubly excited, maximally spin entangled pair state. This state has applications to quantum information and computing that are only beginning to be realized. In this article, we construct and analyze a spin-exciton hamiltonian to describe the dynamics of the two-triplet state. We find the selection rules that connect the doubly excited, spin-singlet state to the manifold of quintet states and comment on the mechanism and conditions for the transition into formally independent triplets. For adjacent dimers that are oriented and immobilized in an inert host, singlet fission can be strongly state-selective. We make predictions for electron paramagnetic resonance experiments and analyze experimental data from recent literature. Our results give conditions for which magnetic resonance pulses can drive transitions between optically polarized magnetic sublevels of the two-exciton states, making it possible to realize quantum gates at room temperature in these systems.
| S-EPMC7595132 | biostudies-literature
Project description:It is an open question how fast information processing can be performed and whether quantum effects can speed up the best existing solutions. Signal extraction, analysis, and compression in diagnostics, astronomy, chemistry, and broadcasting build on the discrete Fourier transform. It is implemented with the fast Fourier transform (FFT) algorithm that assumes a periodic input of specific lengths, which rarely holds true. A lesser-known transform, the Kravchuk-Fourier (KT), allows one to operate on finite strings of arbitrary length. It is of high demand in digital image processing and computer vision but features a prohibitive runtime. Here, we report a one-step computation of a fractional quantum KT. The quantum d-nary (qudit) architecture we use comprises only one gate and offers processing time independent of the input size. The gate may use a multiphoton Hong-Ou-Mandel effect. Existing quantum technologies may scale it up toward diverse applications.
| S-EPMC6641944 | biostudies-literature
Project description:Reservoir computing is a recently introduced, highly efficient bio-inspired approach for processing time dependent data. The basic scheme of reservoir computing consists of a non linear recurrent dynamical system coupled to a single input layer and a single output layer. Within these constraints many implementations are possible. Here we report an optoelectronic implementation of reservoir computing based on a recently proposed architecture consisting of a single non linear node and a delay line. Our implementation is sufficiently fast for real time information processing. We illustrate its performance on tasks of practical importance such as nonlinear channel equalization and speech recognition, and obtain results comparable to state of the art digital implementations.
| S-EPMC3286854 | biostudies-literature
Project description:Quantum reservoir computing (QRC) has been proposed as a paradigm for performing machine learning with quantum processors where the training takes place in the classical domain, avoiding the issue of barren plateaus in parameterized-circuit quantum neural networks. It is natural to consider using a quantum processor based on microwave superconducting circuits to classify microwave signals that are analog-continuous in time. However, while there have been theoretical proposals of analog QRC, to date QRC has been implemented using the circuit model-imposing a discretization of the incoming signal in time. In this paper we show how a quantum superconducting circuit comprising an oscillator coupled to a qubit can be used as an analog quantum reservoir for a variety of classification tasks, achieving high accuracy on all of them. Our work demonstrates processing of ultra-low-power microwave signals within our superconducting circuit, a step towards achieving a quantum sensing-computational advantage on impinging microwave signals.
| S-EPMC11364634 | biostudies-literature
Project description:Landauer's principle makes a strong connection between information theory and thermodynamics by stating that erasing a one-bit memory at temperature [Formula: see text] requires an average energy larger than [Formula: see text], with [Formula: see text] Boltzmann's constant. This tiny limit has been saturated in model experiments using quasistatic processes. For faster operations, an overhead proportional to the processing speed and to the memory damping appears. In this article, we show that underdamped systems are a winning strategy to reduce this extra energetic cost. We prove both experimentally and theoretically that, in the limit of vanishing dissipation mechanisms in the memory, the physical system is thermally insulated from its environment during fast erasures, i.e., fast protocols are adiabatic as no heat is exchanged with the bath. Using a fast optimal erasure protocol, we also show that these adiabatic processes produce a maximum adiabatic temperature [Formula: see text], and that Landauer's bound for fast erasures in underdamped systems becomes the adiabatic bound: [Formula: see text].
| S-EPMC10523555 | biostudies-literature
Project description:Reservoir computing is a best-in-class machine learning algorithm for processing information generated by dynamical systems using observed time-series data. Importantly, it requires very small training data sets, uses linear optimization, and thus requires minimal computing resources. However, the algorithm uses randomly sampled matrices to define the underlying recurrent neural network and has a multitude of metaparameters that must be optimized. Recent results demonstrate the equivalence of reservoir computing to nonlinear vector autoregression, which requires no random matrices, fewer metaparameters, and provides interpretable results. Here, we demonstrate that nonlinear vector autoregression excels at reservoir computing benchmark tasks and requires even shorter training data sets and training time, heralding the next generation of reservoir computing.
| S-EPMC8455577 | biostudies-literature
Project description:Complex entangled states are the key resources for measurement-based quantum computations, which is realised by performing a sequence of measurements on initially entangled qubits. Executable quantum algorithms in the graph-state quantum computing model are determined by the entanglement structure and the connectivity of entangled qubits. By generalisation from graph-type entanglement in which only the nearest qubits interact to a new type of hypergraph entanglement in which any subset of qubits can be arbitrarily entangled via hyperedges, hypergraph states represent more general resource states that allow arbitrary quantum computation with Pauli universality. Here we report experimental preparation, certification and processing of complete categories of four-qubit hypergraph states under the principle of local unitary equivalence, on a fully reprogrammable silicon-photonic quantum chip. Genuine multipartite entanglement for hypergraph states is certificated by the characterisation of entanglement witness, and the observation of violations of Mermin inequalities without any closure of distance or detection loopholes. A basic measurement-based protocol and an efficient resource state verification by color-encoding stabilizers are implemented with local Pauli measurement to benchmark the building blocks for hypergraph-state quantum computation. Our work prototypes hypergraph entanglement as a general resource for quantum information processing.
| S-EPMC10960808 | biostudies-literature