Quantum metrology using quantum combs and tensor network formalism

• URL: http://arxiv.org/abs/2403.04854v1
• Date: Thu, 7 Mar 2024 19:08:05 GMT
• Title: Quantum metrology using quantum combs and tensor network formalism
• Authors: Stanislaw Kurdzialek, Piotr Dulian, Joanna Majsak, Sagnik Chakraborty, Rafal Demkowicz-Dobrzanski
• Abstract summary: We develop an efficient algorithm for determining optimal adaptive quantum estimation protocols with arbitrary quantum control operations between subsequent uses of a probed channel. We introduce a tensor network representation of an estimation strategy, which drastically reduces the time and memory consumption of the algorithm.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We develop an efficient algorithm for determining optimal adaptive quantum estimation protocols with arbitrary quantum control operations between subsequent uses of a probed channel.We introduce a tensor network representation of an estimation strategy, which drastically reduces the time and memory consumption of the algorithm, and allows us to analyze metrological protocols involving up to $N=50$ qubit channel uses, whereas the state-of-the-art approaches are limited to $N<5$. The method is applied to study the performance of the optimal adaptive metrological protocols in presence of various noise types, including correlated noise.

Related papers

• Efficient tensor networks for control-enhanced quantum metrology [9.570188943432331]
  We propose efficient tensor network algorithms for optimizing strategies of quantum metrology enhanced by a long sequence of control operations. Our algorithm has a good performance in optimizing the metrological strategy for as many as $N=100$ queries.
  arXiv  Detail & Related papers  (2024-03-14T16:02:27Z)
• Efficient DCQO Algorithm within the Impulse Regime for Portfolio Optimization [41.94295877935867]
  We propose a faster digital quantum algorithm for portfolio optimization using the digitized-counterdiabatic quantum optimization (DCQO) paradigm. Our approach notably reduces the circuit depth requirement of the algorithm and enhances the solution accuracy, making it suitable for current quantum processors. We experimentally demonstrate the advantages of our protocol using up to 20 qubits on an IonQ trapped-ion quantum computer.
  arXiv  Detail & Related papers  (2023-08-29T17:53:08Z)
• Quantization Aware Factorization for Deep Neural Network Compression [20.04951101799232]
  decomposition of convolutional and fully-connected layers is an effective way to reduce parameters and FLOP in neural networks. A conventional post-training quantization approach applied to networks with weights yields a drop in accuracy. This motivated us to develop an algorithm that finds decomposed approximation directly with quantized factors.
  arXiv  Detail & Related papers  (2023-08-08T21:38:02Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Adaptive POVM implementations and measurement error mitigation strategies for near-term quantum devices [0.0]
  We present adaptive measurement techniques tailored for variational quantum algorithms on near-term small and noisy devices. Our numerical simulations clearly indicate that the presented strategies can significantly reduce the number of needed shots to achieve chemical accuracy in variational quantum eigensolvers.
  arXiv  Detail & Related papers  (2022-08-16T16:05:40Z)
• Optimal quantum control via genetic algorithms for quantum state engineering in driven-resonator mediated networks [68.8204255655161]
  We employ a machine learning-enabled approach to quantum state engineering based on evolutionary algorithms. We consider a network of qubits -- encoded in the states of artificial atoms with no direct coupling -- interacting via a common single-mode driven microwave resonator. We observe high quantum fidelities and resilience to noise, despite the algorithm being trained in the ideal noise-free setting.
  arXiv  Detail & Related papers  (2022-06-29T14:34:00Z)
• Optimal two-qubit gates in recurrence protocols of entanglement purification [0.0]
  The proposed method is based on a numerical search in the whole set of SU(4) matrices with the aid of a quasi-Newton algorithm. We show for certain families of states that optimal protocols are not necessarily achieved by bilaterally applied controlled-NOT gates.
  arXiv  Detail & Related papers  (2022-05-24T14:13:56Z)
• Purification and Entanglement Routing on Quantum Networks [55.41644538483948]
  A quantum network equipped with imperfect channel fidelities and limited memory storage time can distribute entanglement between users. We introduce effectives enabling fast path-finding algorithms for maximizing entanglement shared between two nodes on a quantum network.
  arXiv  Detail & Related papers  (2020-11-23T19:00:01Z)
• Tunable Tradeoff between Quantum and Classical Computation via Nonunitary Zeno-like Dynamics [0.5249805590164902]
  We show that the algorithm scales similarly to the pure quantum version by deriving tight analytical lower bounds on its efficiency. We also study the behavior of the algorithm subject to noise, and find that under certain oracle and operational errors our measurement-based algorithm outperforms the standard algorithm.
  arXiv  Detail & Related papers  (2020-11-22T00:57:17Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)
• Stochastic Markov Gradient Descent and Training Low-Bit Neural Networks [77.34726150561087]
  We introduce Gradient Markov Descent (SMGD), a discrete optimization method applicable to training quantized neural networks. We provide theoretical guarantees of algorithm performance as well as encouraging numerical results.
  arXiv  Detail & Related papers  (2020-08-25T15:48:15Z)

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.