Related papers: An efficient protocol of quantum walk in circuit Q…
Quantum walks are powerful kernels in quantum computing protocols that possess strong capabilities in speeding up various simulation and optimisation tasks. One striking example is given by quantum walkers evolving on glued trees for their…
A new model of nonlinear charged quantum relativistic fluids is presented. This model can be discretized into Discrete Time Quantum Walks (DTQWs), and a new hybrid (quantum-classical) algorithm for implementing these walks on NISQ devices…
Decoded Quantum Interferometry (DQI) is a recently proposed quantum algorithm for approximating solutions to combinatorial optimization problems by reducing instances of linear satisfiability to bounded-distance decoding over superpositions…
In this work we map NISQ-friendly implementations of the non-interacting QCA to a circuit Quantum Electrodynamics (cQED) hardware. We perform both noiseless and noisy simulations of the QCA one particle sector, namely the Quantum Walk, on…
This work provides a relativistic, digital quantum simulation scheme for both $2+1$ and $3+1$ dimensional quantum electrodynamics (QED), based on a discrete spacetime formulation of theory. It takes the form of a quantum circuit, infinitely…
Many-particle continuous-time quantum walks (CTQWs) represent a resource for several tasks in quantum technology, including quantum search algorithms and universal quantum computation. In order to design and implement CTQWs in a realistic…
High-dimensional quantum systems can offer extended possibilities and multiple advantages while developing advanced quantum technologies. In this paper, we propose a class of quantum-walk architecture networks that admit the efficient…
Quantum walks provide a framework for understanding and designing quantum algorithms that is both intuitive and universal. To leverage the computational power of these walks, it is important to be able to programmably modify the graph a…
The coherent superposition of position states in a quantum walk (QW) can be precisely engineered towards the desired distributions to meet the need of quantum information applications. The coherent distribution can make full use of 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…
We consider a one-dimensional chain of many superconducting quantum interference devices (SQUIDs), serving as charge qubits. Each SQUID is coupled to its nearest neighbors through constant capacitances. We study the quantum logic operations…
Robust quantum computation with d-level quantum systems (qudits) poses two requirements: fast, parallel quantum gates and high fidelity two-qudit gates. We first describe how to implement parallel single qudit operations. It is by now well…
We present a detailed analysis of continuous time quantum walks (CTQW) with both position and transition defects defined at a single point in the line. Analytical solutions of both traveling waves or bound states are obtained, which provide…
We develop qutrit circuit models for discrete-time three-state quantum walks on Cayley graphs corresponding to Dihedral groups $D_N$ and the additive groups of integers modulo any positive integer $N$. The proposed circuits comprise of…
Quantum walks with one-dimensional translational symmetry are important for quantum algorithms, where the speed-up of the diffusion speed can be reached if long-range couplings are added. Our work studies a scheme of a ring under the strong…
The quantum circuit model allows gates between any pair of qubits yet physical instantiations allow only limited interactions. We address this problem by providing an interaction graph together with an efficient method for compiling quantum…
In this work, we present a new model of the Discrete-Time Open Quantum Walk (DTOQW) applicable to an arbitrary graph, thereby going beyond the case of quantum walks on regular graphs. We study the impact of noise in the dynamics of quantum…
Variational quantum algorithms have become the de facto model for current quantum computations. A prominent example of such algorithms -- the quantum approximate optimization algorithm (QAOA) -- was originally designed for combinatorial…
Improvement in secure transmission of information is an urgent practical need for governments, corporations and individuals. Quantum key distribution (QKD) promises security based on the laws of physics and has rapidly grown from…
Quantum devices comprised of elementary components with more than two stable levels - so-called qudits - enrich the accessible Hilbert space, enabling applications ranging from fault-tolerant quantum computing to simulating complex…