Improving performance of logical qubits by parameter tuning and topology compensation

• URL: http://arxiv.org/abs/2006.04913v2
• Date: Thu, 6 Aug 2020 23:47:10 GMT
• Title: Improving performance of logical qubits by parameter tuning and topology compensation
• Authors: Jack Raymond and Ndiam\'e Ndiaye and Gautam Rayaprolu and Andrew King
• Abstract summary: We discuss tuning of the transformation for the cases of clique, biclique, and cubic lattice problems on the D-Wave 2000Q quantum computer. Inhomogeneities in effective coupling strength arising from minor-embedding are shown to be mitigated by an efficient reweighting of programmed couplings.
• Score: 1.8352113484137624
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Optimization or sampling of arbitrary pairwise Ising models, in a quantum annealing protocol of constrained interaction topology, can be enabled by a minor-embedding procedure. The logical problem of interest is transformed to a physical (device programmable) problem, where one binary variable is represented by a logical qubit consisting of multiple physical qubits. In this paper we discuss tuning of this transformation for the cases of clique, biclique, and cubic lattice problems on the D-Wave 2000Q quantum computer. We demonstrate parameter tuning protocols in spin glasses and channel communication problems, focusing on anneal duration, chain strength, and mapping from the result on physical qubits back to the logical space. Inhomogeneities in effective coupling strength arising from minor-embedding are shown to be mitigated by an efficient reweighting of programmed couplings, accounting for logical qubit topology.

Related papers

• Cavity Mediated Two-Qubit Gate: Tuning to Optimal Performance with NISQ Era Quantum Simulations [0.019999259391104387]
  We study the case of cavity mediated two-qubit gates.<n>We implement simulations with quantum circuits that are able to reliably track the dynamics of the system.<n>Our quantum algorithm, compatible with NISQ (Noisy Intermediate Scale Quantum) era systems, allows us to map out the fidelity of the state transfer operation between qubits.
  arXiv  Detail & Related papers  (2025-12-12T20:43:42Z)
• Quantum Approximate Optimization Algorithm for MIMO with Quantized b-bit Beamforming [47.98440449939344]
  Multiple-input multiple-output (MIMO) is critical for 6G communication, offering improved spectral efficiency and reliability.<n>This paper explores the use of the Quantum Approximate Optimization Algorithm (QAOA) and alternating optimization to address the problem of b-bit quantized phase shifters both at the transmitter and the receiver.<n>We demonstrate that the structure of this quantized beamforming problem aligns naturally with hybrid-classical methods like QAOA, as the phase shifts used in beamforming can be directly mapped to rotation gates in a quantum circuit.
  arXiv  Detail & Related papers  (2025-10-07T17:53:02Z)
• Efficiency of Dynamical Decoupling for (Almost) Any Spin-Boson Model [44.99833362998488]
  We analytically study the dynamical decoupling of a two-level system coupled with a structured bosonic environment. We find sufficient conditions under which dynamical decoupling works for such systems. Our bounds reproduce the correct scaling in various relevant system parameters.
  arXiv  Detail & Related papers  (2024-09-24T04:58:28Z)
• LogicMP: A Neuro-symbolic Approach for Encoding First-order Logic Constraints [46.60806942245395]
  This paper proposes a novel neural layer, LogicMP, whose layers perform mean-field variational inference over an MLN.<n>It can be plugged into any off-the-shelf neural network to encode FOLCs while retaining modularity and efficiency.<n> Empirical results in three kinds of tasks over graphs, images, and text show that LogicMP outperforms advanced competitors in both performance and efficiency.
  arXiv  Detail & Related papers  (2023-09-27T07:52:30Z)
• Dynamical subset sampling of quantum error correcting protocols [0.0]
  We show the capabilities of dynamical subset sampling with examples from fault-tolerant (FT) QEC. We show that, in a typical stabilizer simulation with incoherent Pauli noise of strength $p = 10-3$, our method can reach a required sampling accuracy on the logical failure rate.
  arXiv  Detail & Related papers  (2023-09-22T10:32:20Z)
• Hybrid Logical-Physical Qubit Interaction as a Post Selection Oracle [0.0]
  We demonstrate a property of the quantum 5-qubit stabilizer code that enables the interaction between qubits of different logical layers. We conduct a full density-matrix simulation of an interaction between a logical and a physical qubit.
  arXiv  Detail & Related papers  (2023-06-08T08:25:43Z)
• Efficient estimation of trainability for variational quantum circuits [43.028111013960206]
  We find an efficient method to compute the cost function and its variance for a wide class of variational quantum circuits. This method can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem.
  arXiv  Detail & Related papers  (2023-02-09T14:05:18Z)
• 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)
• Error-Tolerant Geometric Quantum Control for Logical Qubits with Minimal Resource [4.354697470999286]
  We propose a new fast and robust geometric scheme, with the decoherence-free-subspace encoding, and present its physical implementation on superconducting quantum circuits. Our scheme can consolidate both error suppression methods for logical-qubit control, which sheds light on the future large-scale quantum computation.
  arXiv  Detail & Related papers  (2021-12-16T12:10:41Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Quantum Causal Unravelling [44.356294905844834]
  We develop the first efficient method for unravelling the causal structure of the interactions in a multipartite quantum process. Our algorithms can be used to identify processes that can be characterized efficiently with the technique of quantum process tomography.
  arXiv  Detail & Related papers  (2021-09-27T16:28:06Z)
• Accurate methods for the analysis of strong-drive effects in parametric gates [94.70553167084388]
  We show how to efficiently extract gate parameters using exact numerics and a perturbative analytical approach. We identify optimal regimes of operation for different types of gates including $i$SWAP, controlled-Z, and CNOT.
  arXiv  Detail & Related papers  (2021-07-06T02:02:54Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• Universal quantum computation with symmetric qubit clusters coupled to an environment [0.3670422696827526]
  We propose a scalable scheme for universal quantum computation where cores play the role of quantum-computational transistors, quansistors. We include quantum errors as a main source of decoherence, and show that symmetry makes logical operations particularly resilient to untimely anisotropic qubit rotations. Many of our results can be generalized to higher-level omega-rotation-invariant systems, or adapted to clusters with other symmetries.
  arXiv  Detail & Related papers  (2021-06-01T19:59:41Z)
• Suppressing Coherent Two-Qubit Errors via Dynamical Decoupling [20.280283640450723]
  We show how to implement dynamical-decoupling techniques to suppress the two-qubit analogue of the dephasing on a superconducting quantum device. The pure-dephasing time shows an up to 14 times enhancement on average when using robust sequences. Our study further reveals the decohering processes associated with tunable couplers and establishes a framework to develop gates and sequences robust against two-qubit errors.
  arXiv  Detail & Related papers  (2021-04-06T16:58:42Z)
• Relaxation times do not capture logical qubit dynamics [50.04886706729045]
  We show that spatial noise correlations can give rise to rich and counter-intuitive dynamical behavior of logical qubits. This work will help to guide and benchmark experimental implementations of logical qubits.
  arXiv  Detail & Related papers  (2020-12-14T19:51:19Z)
• Representation matching for delegated quantum computing [64.67104066707309]
  representation matching is a generic probabilistic protocol for reducing the cost of quantum computation in a quantum network. We show that the representation matching protocol is capable of reducing the communication or memory cost to almost minimum in various tasks.
  arXiv  Detail & Related papers  (2020-09-14T18:07:43Z)
• Entangling logical qubits with lattice surgery [47.037230560588604]
  We show the experimental realization of lattice surgery between two topologically encoded qubits in a 10-qubit ion trap quantum information processor. In particular, we demonstrate entanglement between two logical qubits and we implement logical state teleportation.
  arXiv  Detail & Related papers  (2020-06-04T18:00:09Z)

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.