Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

A Rout to Protect Quantum Gates constructed via quantum walks from Noises.

ABSTRACT: The continuous-time quantum walk on a one-dimensional graph of odd number of sites with an on-site potential at the center is studied. We show that such a quantum-walk system can construct an X-gate of a single qubit as well as a control gate for two qubits, when the potential is much larger than the hopping strength. We investigate the decoherence effect and find that the coherence time can be enhanced by either increasing the number of sites on the graph or the ratio of the potential to the hopping strength, which is expected to motivate the design of the quantum gate with long coherence time. We also suggest several experimental proposals to realize such a system.

SUBMITTER: Du YM

PROVIDER: S-EPMC5940792 | biostudies-other | 2018 May

REPOSITORIES: biostudies-other

ACCESS DATA

Json Xml

Publications

A Rout to Protect Quantum Gates constructed via quantum walks from Noises.

Du Yi-Mu YM Lu Li-Hua LH Li You-Quan YQ

Scientific reports 20180508 1

The continuous-time quantum walk on a one-dimensional graph of odd number of sites with an on-site potential at the center is studied. We show that such a quantum-walk system can construct an X-gate of a single qubit as well as a control gate for two qubits, when the potential is much larger than the hopping strength. We investigate the decoherence effect and find that the coherence time can be enhanced by either increasing the number of sites on the graph or the ratio of the potential to the ho ...[more]

PMID: 29740079

Similar Datasets

Quantum sensing of noises in one and two dimensional quantum walks.

Project description:Quantum walk (QW) provides a versatile platform for the realization of quantum algorithms. Due to the existence of the inevitable noises in the walk, the different quantum algorithms accommodating to different noises are demanded. Thus, the success of the algorithms based on the QW requires us to sense different noises in the walk. Until now, the way to distinguish different noises in the walk has been discussed rarely. Here, we propose an efficient way to sense the noises in the one and two dimensional QWs. The populations of the coin in the walk with or without decoherence are presented. By only detecting the populations of the coin in the QW, we can determine whether there exists the decoherence in the total QW system. Moreover, the non-Markovianity of the coin in the one and two dimensional QWs is revealed, in which the coin is taken as an open quantum system, and the other components of the QW system is taken as the large environment. With the measured value of the non-Markovianity for the coin, we can conjecture which kinds of noise emerges in the one and two dimensional QWs.

| S-EPMC5504040 | biostudies-other

Benchmarking universal quantum gates via channel spectrum.

Project description:Noise remains the major obstacle to scalable quantum computation. Quantum benchmarking provides key information on noise properties and is an important step for developing more advanced quantum processors. However, current benchmarking methods are either limited to a specific subset of quantum gates or cannot directly describe the performance of the individual target gate. To overcome these limitations, we propose channel spectrum benchmarking (CSB), a method to infer the noise properties of the target gate, including process fidelity, stochastic fidelity, and some unitary parameters, from the eigenvalues of its noisy channel. Our CSB method is insensitive to state-preparation and measurement errors, and importantly, can benchmark universal gates and is scalable to many-qubit systems. Unlike standard randomized schemes, CSB can provide direct noise information for both target native gates and circuit fragments, allowing benchmarking and calibration of global entangling gates and frequently used modules in quantum algorithms like Trotterized Hamiltonian evolution operator in quantum simulation.

| S-EPMC10514318 | biostudies-literature

Deterministic realization of collective measurements via photonic quantum walks.

Project description:Collective measurements on identically prepared quantum systems can extract more information than local measurements, thereby enhancing information-processing efficiency. Although this nonclassical phenomenon has been known for two decades, it has remained a challenging task to demonstrate the advantage of collective measurements in experiments. Here, we introduce a general recipe for performing deterministic collective measurements on two identically prepared qubits based on quantum walks. Using photonic quantum walks, we realize experimentally an optimized collective measurement with fidelity 0.9946 without post selection. As an application, we achieve the highest tomographic efficiency in qubit state tomography to date. Our work offers an effective recipe for beating the precision limit of local measurements in quantum state tomography and metrology. In addition, our study opens an avenue for harvesting the power of collective measurements in quantum information-processing and for exploring the intriguing physics behind this power.

| S-EPMC5897416 | biostudies-literature

Floquet-engineered quantum walks.

Project description:The quantum walk is the quantum-mechanical analogue of the classical random walk, which offers an advanced tool for both simulating highly complex quantum systems and building quantum algorithms in a wide range of research areas. One prominent application is in computational models capable of performing any quantum computation, in which precisely controlled state transfer is required. It is, however, generally difficult to control the behavior of quantum walks due to stochastic processes. Here we unveil the walking mechanism based on its particle-wave duality and then present tailoring quantum walks using the walking mechanism (Floquet oscillations) under designed time-dependent coins, to manipulate the desired state on demand, as in universal quantum computation primitives. Our results open the path towards control of quantum walks.

| S-EPMC7567857 | biostudies-literature

Fast non-Abelian geometric gates via transitionless quantum driving.

Project description:A practical quantum computer must be capable of performing high fidelity quantum gates on a set of quantum bits (qubits). In the presence of noise, the realization of such gates poses daunting challenges. Geometric phases, which possess intrinsic noise-tolerant features, hold the promise for performing robust quantum computation. In particular, quantum holonomies, i.e., non-Abelian geometric phases, naturally lead to universal quantum computation due to their non-commutativity. Although quantum gates based on adiabatic holonomies have already been proposed, the slow evolution eventually compromises qubit coherence and computational power. Here, we propose a general approach to speed up an implementation of adiabatic holonomic gates by using transitionless driving techniques and show how such a universal set of fast geometric quantum gates in a superconducting circuit architecture can be obtained in an all-geometric approach. Compared with standard non-adiabatic holonomic quantum computation, the holonomies obtained in our approach tends asymptotically to those of the adiabatic approach in the long run-time limit and thus might open up a new horizon for realizing a practical quantum computer.

| S-EPMC4685308 | biostudies-literature

Quantum aspects of evolution: a contribution towards evolutionary explorations of genotype networks via quantum walks.

Project description:Quantum biology seeks to explain biological phenomena via quantum mechanisms, such as enzyme reaction rates via tunnelling and photosynthesis energy efficiency via coherent superposition of states. However, less effort has been devoted to study the role of quantum mechanisms in biological evolution. In this paper, we used transcription factor networks with two and four different phenotypes, and used classical random walks (CRW) and quantum walks (QW) to compare network search behaviour and efficiency at finding novel phenotypes between CRW and QW. In the network with two phenotypes, at temporal scales comparable to decoherence time TD, QW are as efficient as CRW at finding new phenotypes. In the case of the network with four phenotypes, the QW had a higher probability of mutating to a novel phenotype than the CRW, regardless of the number of mutational steps (i.e. 1, 2 or 3) away from the new phenotype. Before quantum decoherence, the QW probabilities become higher turning the QW effectively more efficient than CRW at finding novel phenotypes under different starting conditions. Thus, our results warrant further exploration of the QW under more realistic network scenarios (i.e. larger genotype networks) in both closed and open systems (e.g. by considering Lindblad terms).

| S-EPMC7729038 | biostudies-literature

Probing measurement-induced effects in quantum walks via recurrence.

Project description:Measurements on a quantum particle unavoidably affect its state, since the otherwise unitary evolution of the system is interrupted by a nonunitary projection operation. To probe measurement-induced effects in the state dynamics using a quantum simulator, the challenge is to implement controlled measurements on a small subspace of the system and continue the evolution from the complementary subspace. A powerful platform for versatile quantum evolution is represented by photonic quantum walks because of their high control over all relevant parameters. However, measurement-induced dynamics in such a platform have not yet been realized. We implement controlled measurements in a discrete-time quantum walk based on time-multiplexing. This is achieved by adding a deterministic outcoupling of the optical signal to include measurements constrained to specific positions resulting in the projection of the walker's state on the remaining ones. With this platform and coherent input light, we experimentally simulate measurement-induced single-particle quantum dynamics. We demonstrate the difference between dynamics with only a single measurement at the final step and those including measurements during the evolution. To this aim, we study recurrence as a figure of merit, that is, the return probability to the walker's starting position, which is measured in the two cases. We track the development of the return probability over 36 time steps and observe the onset of both recurrent and transient evolution as an effect of the different measurement schemes, a signature which only emerges for quantum systems. Our simulation of the observed one-particle conditional quantum dynamics does not require a genuine quantum particle but is demonstrated with coherent light.

| S-EPMC6025909 | biostudies-other

Disease gene prioritization with quantum walks.

Project description:MotivationDisease gene prioritization methods assign scores to genes or proteins according to their likely relevance for a given disease based on a provided set of seed genes. This scoring can be used to find new biologically relevant genes or proteins for many diseases. Although methods based on classical random walks have proven to yield competitive results, quantum walk methods have not been explored to this end.ResultsWe propose a new algorithm for disease gene prioritization based on continuous-time quantum walks using the adjacency matrix of a protein-protein interaction (PPI) network. We demonstrate the success of our proposed quantum walk method by comparing it to several well-known gene prioritization methods on three disease sets, across seven different PPI networks. In order to compare these methods, we use cross-validation and examine the mean reciprocal ranks of recall and average precision values. We further validate our method by performing an enrichment analysis of the predicted genes for coronary artery disease.Availability and implementationThe data and code for the methods can be accessed at https://github.com/markgolds/qdgp.

| S-EPMC11361815 | biostudies-literature

Novel image encryption based on quantum walks.

Project description:Quantum computation has achieved a tremendous success during the last decades. In this paper, we investigate the potential application of a famous quantum computation model, i.e., quantum walks (QW) in image encryption. It is found that QW can serve as an excellent key generator thanks to its inherent nonlinear chaotic dynamic behavior. Furthermore, we construct a novel QW-based image encryption algorithm. Simulations and performance comparisons show that the proposal is secure enough for image encryption and outperforms prior works. It also opens the door towards introducing quantum computation into image encryption and promotes the convergence between quantum computation and image processing.

| S-EPMC4293593 | biostudies-literature

Genetic programs constructed from layered logic gates in single cells.

Project description:Genetic programs function to integrate environmental sensors, implement signal processing algorithms and control expression dynamics. These programs consist of integrated genetic circuits that individually implement operations ranging from digital logic to dynamic circuits, and they have been used in various cellular engineering applications, including the implementation of process control in metabolic networks and the coordination of spatial differentiation in artificial tissues. A key limitation is that the circuits are based on biochemical interactions occurring in the confined volume of the cell, so the size of programs has been limited to a few circuits. Here we apply part mining and directed evolution to build a set of transcriptional AND gates in Escherichia coli. Each AND gate integrates two promoter inputs and controls one promoter output. This allows the gates to be layered by having the output promoter of an upstream circuit serve as the input promoter for a downstream circuit. Each gate consists of a transcription factor that requires a second chaperone protein to activate the output promoter. Multiple activator-chaperone pairs are identified from type?III secretion pathways in different strains of bacteria. Directed evolution is applied to increase the dynamic range and orthogonality of the circuits. These gates are connected in different permutations to form programs, the largest of which is a 4-input AND gate that consists of 3 circuits that integrate 4 inducible systems, thus requiring 11 regulatory proteins. Measuring the performance of individual gates is sufficient to capture the behaviour of the complete program. Errors in the output due to delays (faults), a common problem for layered circuits, are not observed. This work demonstrates the successful layering of orthogonal logic gates, a design strategy that could enable the construction of large, integrated circuits in single cells.

| S-EPMC3904217 | biostudies-literature

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