Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Multi-qubit quantum computing using discrete-time quantum walks on closed graphs.

ABSTRACT: Universal quantum computation can be realised using both continuous-time and discrete-time quantum walks. We present a version based on single particle discrete-time quantum walk to realize multi-qubit computation tasks. The scalability of the scheme is demonstrated by using a set of walk operations on a closed lattice form to implement the universal set of quantum gates on multi-qubit system. We also present a set of experimentally realizable walk operations that can implement Grover's algorithm, quantum Fourier transformation and quantum phase estimation algorithms. An elementary implementation of error detection and correction is also presented. Analysis of space and time complexity of the scheme highlights the advantages of quantum walk based model for quantum computation on systems where implementation of quantum walk evolution operations is an inherent feature of the system.

SUBMITTER: Chawla P

PROVIDER: S-EPMC10372037 | biostudies-literature | 2023 Jul

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Multi-qubit quantum computing using discrete-time quantum walks on closed graphs.

Chawla Prateek P Singh Shivani S Agarwal Aman A Srinivasan Sarvesh S Chandrashekar C M CM

Scientific reports 20230726 1

Universal quantum computation can be realised using both continuous-time and discrete-time quantum walks. We present a version based on single particle discrete-time quantum walk to realize multi-qubit computation tasks. The scalability of the scheme is demonstrated by using a set of walk operations on a closed lattice form to implement the universal set of quantum gates on multi-qubit system. We also present a set of experimentally realizable walk operations that can implement Grover's algorith ...[more]

PMID: 37495607

Similar Datasets

On the use of discrete-time quantum walks in decision theory.

Project description:We present a short review of discrete-time quantum walks (DTQW) as a potentially useful and rich formalism to model human decision-making. We present a pedagogical introduction of the underlying formalism and main structural properties. We suggest that DTQW are particularly suitable for combining the two strands of literature on evidence accumulator models and on the quantum formalism of cognition. Due to the additional spin degree of freedom, models based on DTQW allow for a natural modeling of model choice and confidence rating in separate bases. Levels of introspection and self-assessment during choice deliberations can be modeled by the introduction of a probability for measurement of either position and/or spin of the DTQW, where each measurement act leads to a partial decoherence (corresponding to a step towards rationalization) of the deliberation process. We show how quantum walks predict observed probabilistic misperception like S-shaped subjective probability and conjunction fallacy. Our framework emphasizes the close relationship between response times and type of preferences and of responses. In particular, decision theories based on DTQW do not need to invoke two systems ("fast" and "slow") as in dual process theories. Within our DTQW framework, the two fast and slow systems are replaced by a single system, but with two types of self-assessment or introspection. The "thinking fast" regime is obtained with no or little self-assessment, while the "thinking slow" regime corresponds to a strong rate of self-assessment. We predict a trade-off between speed and accuracy, as empirically reported.

| S-EPMC9426940 | biostudies-literature

Two-walker discrete-time quantum walks on the line with percolation.

Project description:One goal in the quantum-walk research is the exploitation of the intrinsic quantum nature of multiple walkers, in order to achieve the full computational power of the model. Here we study the behaviour of two non-interacting particles performing a quantum walk on the line when the possibility of lattice imperfections, in the form of missing links, is considered. We investigate two regimes, statical and dynamical percolation, that correspond to different time scales for the imperfections evolution with respect to the quantum-walk one. By studying the qualitative behaviour of three two-particle quantities for different probabilities of having missing bonds, we argue that the chosen symmetry under particle-exchange of the input state strongly affects the output of the walk, even in noisy and highly non-ideal regimes. We provide evidence against the possibility of gathering information about the walkers indistinguishability from the observation of bunching phenomena in the output distribution, in all those situations that require a comparison between averaged quantities. Although the spread of the walk is not substantially changed by the addition of a second particle, we show that the presence of multiple walkers can be beneficial for a procedure to estimate the probability of having a broken link.

| S-EPMC4766867 | biostudies-other

Few-qubit quantum refrigerator for cooling a multi-qubit system.

Project description:We propose to use a few-qubit system as a compact quantum refrigerator for cooling an interacting multi-qubit system. We specifically consider a central qubit coupled to N ancilla qubits in a so-called spin-star model to be used as refrigerant by means of short interactions with a many-qubit system to be cooled. We first show that if the interaction between the qubits is of the longitudinal and ferromagnetic Ising model form, the central qubit is colder than the environment. We summarize how preparing the refrigerant qubits using the spin-star model paves the way for the cooling of a many-qubit system by means of a collisional route to thermalization. We discuss a simple refrigeration cycle, considering the operation cost and cooling efficiency, which can be controlled by N and the qubit-qubit interaction strength. Besides, bounds on the achievable temperature are established. Such few-qubit compact quantum refrigerators can be significant to reduce dimensions of quantum technology applications, can be easy to integrate into all-qubit systems, and can increase the speed and power of quantum computing and thermal devices.

| S-EPMC8217472 | biostudies-literature

Improving qubit coherence using closed-loop feedback.

Project description:Superconducting qubits are a promising platform for building a larger-scale quantum processor capable of solving otherwise intractable problems. In order for the processor to reach practical viability, the gate errors need to be further suppressed and remain stable for extended periods of time. With recent advances in qubit control, both single- and two-qubit gate fidelities are now in many cases limited by the coherence times of the qubits. Here we experimentally employ closed-loop feedback to stabilize the frequency fluctuations of a superconducting transmon qubit, thereby increasing its coherence time by 26% and reducing the single-qubit error rate from (8.5 ± 2.1) × 10-4 to (5.9 ± 0.7) × 10-4. Importantly, the resulting high-fidelity operation remains effective even away from the qubit flux-noise insensitive point, significantly increasing the frequency bandwidth over which the qubit can be operated with high fidelity. This approach is helpful in large qubit grids, where frequency crowding and parasitic interactions between the qubits limit their performance.

| S-EPMC9001732 | biostudies-literature

A Multi-Classification Hybrid Quantum Neural Network Using an All-Qubit Multi-Observable Measurement Strategy.

Project description:Quantum machine learning is a promising application of quantum computing for data classification. However, most of the previous research focused on binary classification, and there are few studies on multi-classification. The major challenge comes from the limitations of near-term quantum devices on the number of qubits and the size of quantum circuits. In this paper, we propose a hybrid quantum neural network to implement multi-classification of a real-world dataset. We use an average pooling downsampling strategy to reduce the dimensionality of samples, and we design a ladder-like parameterized quantum circuit to disentangle the input states. Besides this, we adopt an all-qubit multi-observable measurement strategy to capture sufficient hidden information from the quantum system. The experimental results show that our algorithm outperforms the classical neural network and performs especially well on different multi-class datasets, which provides some enlightenment for the application of quantum computing to real-world data on near-term quantum processors.

| S-EPMC8947049 | biostudies-literature

Multi-particle quantum walks on 3D integrated photonic chip.

Project description:Quantum walks provide a speed-up in computational power for various quantum algorithms and serve as inspiration for the construction of complex graph representations. Many pioneering works have been dedicated to expanding the experimental state space and the complexity of graphs. However, these experiments are mostly limited to small experimental scale, which do not reach a many-body level and fail to reflect the multi-particle quantum interference effects among non-adjacent modes. Here, we present a quantum walk with three photons on a two-dimensional triangular lattice, which is mapped to a 19 × 19 × 19 high-dimensional state space and constructs a complex graph with 6859 nodes and 45,486 edges. By utilizing the statistical signatures of the output combinations and incorporating machine learning techniques, we successfully validate the nonclassical properties of the experiment. Our implementation provides a paradigm for exponentially expanding the state space and graph complexity of quantum walks, paving the way for surmounting the classical regime in large-scale quantum simulations.

| S-EPMC11489590 | biostudies-literature

Systematic Dimensionality Reduction for Quantum Walks: Optimal Spatial Search and Transport on Non-Regular Graphs.

Project description:Continuous time quantum walks provide an important framework for designing new algorithms and modelling quantum transport and state transfer problems. Often, the graph representing the structure of a problem contains certain symmetries that confine the dynamics to a smaller subspace of the full Hilbert space. In this work, we use invariant subspace methods, that can be computed systematically using the Lanczos algorithm, to obtain the reduced set of states that encompass the dynamics of the problem at hand without the specific knowledge of underlying symmetries. First, we apply this method to obtain new instances of graphs where the spatial quantum search algorithm is optimal: complete graphs with broken links and complete bipartite graphs, in particular, the star graph. These examples show that regularity and high-connectivity are not needed to achieve optimal spatial search. We also show that this method considerably simplifies the calculation of quantum transport efficiencies. Furthermore, we observe improved efficiencies by removing a few links from highly symmetric graphs. Finally, we show that this reduction method also allows us to obtain an upper bound for the fidelity of a single qubit transfer on an XY spin network.

| S-EPMC4557070 | biostudies-literature

Multi-bit quantum random number generation from a single qubit quantum walk.

Project description:We present a scheme for multi-bit quantum random number generation using a single qubit discrete-time quantum walk in one-dimensional space. Irrespective of the initial state of the qubit, quantum interference and entanglement of particle with the position space in the walk dynamics certifies high randomness in the system. Quantum walk in a position space of dimension 2l + 1 ensures string of (l + 2)-bits of random numbers from a single measurement. Bit commitment with the position space and control over the spread of the probability distribution in position space enable us with options to extract multi-bit random numbers. This highlights the power of one qubit, its practical importance in generating multi-bit string in single measurement and the role it can play in quantum communication and cryptographic protocols. This can be further extended with quantum walks in higher dimensions.

| S-EPMC6707389 | biostudies-literature

Discrete-time quantum walk with feed-forward quantum coin.

Project description:Constructing a discrete model like a cellular automaton is a powerful method for understanding various dynamical systems. However, the relationship between the discrete model and its continuous analogue is, in general, nontrivial. As a quantum-mechanical cellular automaton, a discrete-time quantum walk is defined to include various quantum dynamical behavior. Here we generalize a discrete-time quantum walk on a line into the feed-forward quantum coin model, which depends on the coin state of the previous step. We show that our proposed model has an anomalous slow diffusion characterized by the porous-medium equation, while the conventional discrete-time quantum walk model shows ballistic transport.

| S-EPMC3961739 | biostudies-literature

Capturing pairwise and multi-way chromosomal conformations using C-walks

Project description:Chromosomes are folded into highly compacted structures to accommodate physical constraints within nuclei and to regulate access to genomic information. Recently, global mapping of pairwise contacts showed that loops anchoring topological domains (TADs), are highly conserved between cell types and species. Whether pairwise loops synergize to form higher order structures is still unclear. Here we develop a conformation capture approach to study higher order organization using chromosomal walks (C-walks) that link multiple genomic loci together into proximity chains. The data captured a hierarchical chromosomal structure at varying scales. Inter-chromosomal contacts constitute only 7-10% of the pairs and are restricted by the TAD structure of the interfacing chromosomes. About half of the C-walks stay within one chromosome, and almost half of these are restricted to intra-TAD spaces. Analysis of nested topological motifs suggests hierarchical chromosomal structure is present also within TADs. Targeted analysis of thousands of 3-walks anchored at strongly expressed genes support nested, rather than hub-like, chromosomal topology at active loci. Polycomb-repressed HOX domains are shown by the same approach to form synergistic hubs. Together, the data suggest that chromosomal territories, TADs, and intra-TAD loops are primarily driven by nested, possibly dynamic, pairwise contacts.

2016-02-04 | GSE77553 | GEO

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data