Feedback-assisted quantum search by continuous-time quantum walks

• URL: http://arxiv.org/abs/2201.04566v2
• Date: Thu, 10 Nov 2022 15:40:50 GMT
• Title: Feedback-assisted quantum search by continuous-time quantum walks
• Authors: Alessandro Candeloro, Claudia Benedetti, Marco G. Genoni, Matteo G.A. Paris
• Abstract summary: We address the quantum search of a target node on a cycle graph by means of a quantum walk assisted by continuous measurement and feedback. In particular, our protocol is able to drive the walker to a desired target node.
• Score: 58.720142291102135
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We address the quantum search of a target node on a cycle graph by means of a quantum walk assisted by continuous measurement and feedback. Unlike previous spatial search approaches, where the oracle is described as a projector on the target state, we instead consider a dynamical oracle implemented through a feedback Hamiltonian. In particular, our protocol is able to drive the walker to a desired target node. The idea is based on continuously monitoring the position of the quantum walker on the graph and then to apply a unitary feedback operation based on the information obtained from measurement. The feedback changes the couplings between the nodes and it is optimized at each time via a numerical procedure. We numerically simulate the stochastic trajectories describing the evolution for graphs of dimensions up to $N=15$, and quantify the performance of the protocol via the average fidelity between the state of the walker and the target node. We discuss different constraints on the control strategy, in particular on the possible values that the feedback couplings can take. We find that for unbounded controls, the protocol is able to quickly localize the walker on the target node. We then discuss how the performance is lowered by posing an upper bound on the control couplings, but still allowing to stabilize the walker in the desired node. Finally, we show how a digital feedback protocol, where the couplings can take values only from a discrete set, seems in general as efficient as the continuous bounded one.

Related papers

• Walker: Self-supervised Multiple Object Tracking by Walking on Temporal Appearance Graphs [117.67620297750685]
  We introduce Walker, the first self-supervised tracker that learns from videos with sparse bounding box annotations, and no tracking labels. Walker is the first self-supervised tracker to achieve competitive performance on MOT17, DanceTrack, and BDD100K.
  arXiv  Detail & Related papers  (2024-09-25T18:00:00Z)
• QWalkVec: Node Embedding by Quantum Walk [2.0749231618270803]
  A quantum walk is a quantum version of a random walk that demonstrates a faster propagation than a random walk on a graph. We propose QWalkVec, a quantum walk-based node embedding method. We evaluate the effectiveness of QWalkVec in node classification tasks conducted on four small-sized real datasets.
  arXiv  Detail & Related papers  (2024-08-16T05:14:38Z)
• Quantum-walk search in motion [0.0]
  In quantum computing, the quantum walk search algorithm is designed for locating fixed marked nodes within a graph. We introduce additional quantum states to label the marked nodes and extend the algorithm to track a moving particle on a two-dimensional surface. This concept holds promise for a range of applications, from real-time object tracking to network management and routing.
  arXiv  Detail & Related papers  (2023-10-22T16:33:46Z)
• QuTE: decentralized multiple testing on sensor networks with false discovery rate control [130.7122910646076]
  This paper designs methods for decentralized multiple hypothesis testing on graphs equipped with provable guarantees on the false discovery rate (FDR) We consider the setting where distinct agents reside on the nodes of an undirected graph, and each agent possesses p-values corresponding to one or more hypotheses local to its node. Each agent must individually decide whether to reject one or more of its local hypotheses by only communicating with its neighbors, with the joint aim that the global FDR over the entire graph must be controlled at a predefined level.
  arXiv  Detail & Related papers  (2022-10-09T19:48:39Z)
• Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
  We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
  arXiv  Detail & Related papers  (2022-05-20T12:37:09Z)
• Learning Expanding Graphs for Signal Interpolation [14.84852576248587]
  We propose an attachment model for incoming nodes parameterized by the probabilities and connectivity of the specific node. We study real data dealing in cold start collaborative recommendations.
  arXiv  Detail & Related papers  (2022-03-15T14:51:29Z)
• Space-Time Correspondence as a Contrastive Random Walk [47.40711876423659]
  We cast correspondence as prediction of links in a space-time graph constructed from video. We learn a representation in which pairwise similarity defines transition probability of a random walk. We demonstrate that a technique we call edge dropout, as well as self-supervised adaptation at test-time, further improve transfer for object-centric correspondence.
  arXiv  Detail & Related papers  (2020-06-25T17:56:05Z)
• Continuous-time quantum walks in the presence of a quadratic perturbation [55.41644538483948]
  We address the properties of continuous-time quantum walks with Hamiltonians of the form $mathcalH= L + lambda L2$. We consider cycle, complete, and star graphs because paradigmatic models with low/high connectivity and/or symmetry.
  arXiv  Detail & Related papers  (2020-05-13T14:53:36Z)
• Entanglement-Preserving Limit Cycles from Sequential Quantum Measurements and Feedback [0.0]
  Entanglement generation and preservation is a key task in quantum information processing. We propose feedback methods to increase the yield and/or lifetime of entangled two-qubit states.
  arXiv  Detail & Related papers  (2020-03-05T22:37:32Z)
• Discrete-Time Quantum Walks on Oriented Graphs [0.0]
  We define discrete-time quantum walks on arbitrary oriented graphs. We introduce a parameter, called alpha, that quantifies the amount of orientation.
  arXiv  Detail & Related papers  (2020-01-13T01:42:42Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.