相关论文: Continuous-time quantum walk-based ans\"atze on ne…

Research has shown that quantum walks can accelerate certain quantum algorithms and act as a universal paradigm for quantum processing. The discrete-time quantum walk (DTQW) model, owing to its discrete nature, stands out as one of the most…

Rydberg atoms provide a highly promising platform for quantum computation, leveraging their strong tunable interactions to encode and manipulate information in the electronic states of individual atoms. Key advantages of Rydberg atoms…

Aquila, an analog quantum simulation platform developed by QuEra Computing, supports control of the position and coherent evolution of up to 256 neutral atoms. This study details novel experimental protocols designed for analog quantum…

Quantum walks are the quantum-mechanical analog of random walks, in which a quantum `walker' evolves between initial and final states by traversing the edges of a graph, either in discrete steps from node to node or via continuous evolution…

Quantum annealing is a powerful alternative model for quantum computing, which can succeed in the presence of environmental noise even without error correction. However, despite great effort, no conclusive proof of a quantum speedup…

This dissertation presents investigations on dynamics of discrete-time quantum walk and some of its applications. Quantum walks has been exploited as an useful tool for quantum algorithms in quantum computing. Beyond quantum computational…

Enhancing the precision of measurements by harnessing entanglement is a long-sought goal in the field of quantum metrology. Yet attaining the best sensitivity allowed by quantum theory in the presence of noise is an outstanding challenge,…

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 rotation of subspaces by a chosen angle is a fundamental quantum computing operation, with applications in error correction and quantum algorithms such as the Quantum Approximate Optimization Algorithm, the Variational Quantum…

Quantum walks (QWs) are of interest as examples of uniquely quantum behavior and are applicable in a variety of quantum search and simulation models. Implementing QWs on quantum devices is useful from both points of view. We describe a…

Quantum walks, both discrete and continuous, serve as fundamental tools in quantum information processing with diverse applications. This work introduces a hybrid quantum walk model that integrates the coin mechanism of discrete walks with…

The study of quantum walks has been shown to have a wide range of applications in areas such as artificial intelligence, the study of biological processes, and quantum transport. The quantum stochastic walk, which allows for incoherent…

We analyze a continuous-time quantum walk on a chimera graph, which is a graph of choice for designing quantum annealers, and we discover beautiful quantum-walk features such as localization that starkly distinguishes classical from quantum…

With photonics, the quantum computational advantage has been demonstrated on the task of boson sampling. Next, developing quantum-enhanced approaches for practical problems becomes one of the top priorities for photonic systems. Quantum…

We investigate the use of discrete-time quantum walks to sample from an almost-uniform distribution, in the absence of any external source of randomness. Integers are encoded on the vertices of a cycle graph, and a quantum walker evolves…

Quantum walks, the quantum analogue of the classical random walk, have been shown to underpin quantum algorithms for fluid dynamics. We propose the quantum half-adder gate method for quantum walks as a good benchmark algorithm, specifically…

Quantum walk is a useful model to simulate complex quantum systems and to build quantum algorithms; in particular, to develop spatial search algorithms on graphs, which aim to find a marked vertex as quickly as possible. Quantum walks are…

We assess the prospects for algorithms within the general framework of quantum annealing (QA) to achieve a quantum speedup relative to classical state of the art methods in combinatorial optimization and related sampling tasks. We argue for…

Computing using a continuous-time evolution, based on the natural interaction Hamiltonian of the quantum computer hardware, is a promising route to building useful quantum computers in the near-term. Adiabatic quantum computing, quantum…

Quantum Random Walks, which have drawn much attention over the past few decades for their distinctly non-classical behavior, is a promising subfield within Quantum Computing. Theoretical framework and applications for these walks have seen…