Holographic deep thermalization for secure and efficient quantum random state generation

• URL: http://arxiv.org/abs/2411.03587v3
• Date: Mon, 23 Jun 2025 21:18:48 GMT
• Title: Holographic deep thermalization for secure and efficient quantum random state generation
• Authors: Bingzhi Zhang, Peng Xu, Xiaohui Chen, Quntao Zhuang,
• Abstract summary: We introduce holographic deep thermalization, a secure and hardware-efficient quantum random state generator.<n>By adopting a sequential application of a scrambling-measure-reset process, it trades space with time, and substantially reduces the required ancilla size.<n>Thanks to the resource reduction, our circuit-based implementation on IBM Quantum devices achieves genuine $5$-qubit random state generation utilizing only a total of $8$ qubits.
• Score: 15.964002546782305
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Randomness is a cornerstone of science, underpinning fields such as statistics, information theory, dynamical systems, and thermodynamics. In quantum science, quantum randomness, especially random pure states, plays a pivotal role in fundamental questions like black hole physics and quantum complexity, as well as in practical applications such as quantum device benchmarking and quantum advantage certification. The conventional approach for generating genuine random states, called `deep thermalization', faces significant challenges, including scalability issues due to the need for a large ancilla system and susceptibility to attacks, as demonstrated in this work. We introduce holographic deep thermalization, a secure and hardware-efficient quantum random state generator. By adopting a sequential application of a scrambling-measure-reset process, it continuously trades space with time, and substantially reduces the required ancilla size to as small as a system-size independent constant; At the same time, it guarantees security by removing quantum correlation between the data system and attackers. Thanks to the resource reduction, our circuit-based implementation on IBM Quantum devices achieves genuine $5$-qubit random state generation utilizing only a total of $8$ qubits.

Related papers

• Certified Random Number Generation using Quantum Computers [0.0]
  We investigate how current quantum computers can be leveraged for practical applications. We generate secure random numbers certified by Quantum Mechanics. By applying this protocol to existing quantum computers, we demonstrate the feasibility of secure, semi-device-independent random number generation.
  arXiv  Detail & Related papers  (2025-02-05T08:19:18Z)
• Quantum One-Time Protection of any Randomized Algorithm [0.03320194947871346]
  A quantum one-time token is a quantum state that permits a certain program to be evaluated exactly once.<n>We propose a scheme for building quantum one-time tokens for any randomized classical program, which include generative AI models.
  arXiv  Detail & Related papers  (2024-11-05T18:00:29Z)
• A Quantum-Resistant Photonic Hash Function [0.0]
  We propose a quantum hash function based on Gaussian boson sampling on a photonic quantum computer. Our work lays the foundation for a new paradigm of quantum-resistant hashing with applications in emerging quantum-era information systems.
  arXiv  Detail & Related papers  (2024-09-30T04:19:26Z)
• The curse of random quantum data [62.24825255497622]
  We quantify the performances of quantum machine learning in the landscape of quantum data. We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits. Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
  arXiv  Detail & Related papers  (2024-08-19T12:18:07Z)
• Observation of a non-Hermitian supersonic mode on a trapped-ion quantum computer [6.846670002217106]
  We demonstrate the power of variational quantum circuits for resource-efficient simulations of dynamical and equilibrium physics in non-Hermitian systems. Using a variational quantum compilation scheme for fermionic systems, we reduce gate count, save qubits, and eliminate the need for postselection. We provide an analytical example demonstrating that simulating single-qubit non-Hermitian dynamics for $Theta(log(n))$ time from certain initial states is exponentially hard on a quantum computer.
  arXiv  Detail & Related papers  (2024-06-21T18:00:06Z)
• Quantum quench dynamics as a shortcut to adiabaticity [31.114245664719455]
  We develop and test a quantum algorithm in which the incorporation of a quench step serves as a remedy to the diverging adiabatic timescale. Our experiments show that this approach significantly outperforms the adiabatic algorithm.
  arXiv  Detail & Related papers  (2024-05-31T17:07:43Z)
• Thermalization and Criticality on an Analog-Digital Quantum Simulator [133.58336306417294]
  We present a quantum simulator comprising 69 superconducting qubits which supports both universal quantum gates and high-fidelity analog evolution. We observe signatures of the classical Kosterlitz-Thouless phase transition, as well as strong deviations from Kibble-Zurek scaling predictions. We digitally prepare the system in pairwise-entangled dimer states and image the transport of energy and vorticity during thermalization.
  arXiv  Detail & Related papers  (2024-05-27T17:40:39Z)
• Resource-Efficient Hybrid Quantum-Classical Simulation Algorithm [0.0]
  Digital quantum computers promise exponential speedups in performing quantum time-evolution. The task of extracting desired quantum properties at intermediate time steps remains a computational bottleneck. We propose a hybrid simulator that enables classical computers to leverage FTQC devices and quantum time propagators to overcome this bottleneck.
  arXiv  Detail & Related papers  (2024-05-17T04:17:27Z)
• Quantum computational advantage with constant-temperature Gibbs sampling [1.1930434318557157]
  A quantum system coupled to a bath at some fixed, finite temperature converges to its Gibbs state. This thermalization process defines a natural, physically-motivated model of quantum computation. We consider sampling from the measurement outcome distribution of quantum Gibbs states at constant temperatures.
  arXiv  Detail & Related papers  (2024-04-23T00:29:21Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• Probing critical states of matter on a digital quantum computer [0.0]
  We describe a zero-temperature phase transition, where scaling laws emerge entirely due to quantum correlations over a diverging length scale. Our results suggest a viable path to quantum-assisted tensor network contraction beyond the limits of classical methods.
  arXiv  Detail & Related papers  (2023-05-02T17:59:46Z)
• Universality of critical dynamics with finite entanglement [68.8204255655161]
  We study how low-energy dynamics of quantum systems near criticality are modified by finite entanglement. Our result establishes the precise role played by entanglement in time-dependent critical phenomena.
  arXiv  Detail & Related papers  (2023-01-23T19:23:54Z)
• Hybrid quantum gap estimation algorithm using a filtered time series [0.0]
  We prove that classical post-processing, i.e., long-time filtering of an offline time series, exponentially improves the circuit depth needed for quantum time evolution. We apply the filtering method to the construction of a hybrid quantum-classical algorithm to estimate energy gap. Our findings set the stage for unbiased quantum simulation to offer memory advantage in the near term.
  arXiv  Detail & Related papers  (2022-12-28T18:59:59Z)
• Iterative Qubits Management for Quantum Index Searching in a Hybrid System [56.39703478198019]
  IQuCS aims at index searching and counting in a quantum-classical hybrid system. We implement IQuCS with Qiskit and conduct intensive experiments. Results demonstrate that it reduces qubits consumption by up to 66.2%.
  arXiv  Detail & Related papers  (2022-09-22T21:54:28Z)
• Probing finite-temperature observables in quantum simulators of spin systems with short-time dynamics [62.997667081978825]
  We show how finite-temperature observables can be obtained with an algorithm motivated from the Jarzynski equality. We show that a finite temperature phase transition in the long-range transverse field Ising model can be characterized in trapped ion quantum simulators.
  arXiv  Detail & Related papers  (2022-06-03T18:00:02Z)
• Noisy Quantum Kernel Machines [58.09028887465797]
  An emerging class of quantum learning machines is that based on the paradigm of quantum kernels. We study how dissipation and decoherence affect their performance. We show that decoherence and dissipation can be seen as an implicit regularization for the quantum kernel machines.
  arXiv  Detail & Related papers  (2022-04-26T09:52:02Z)
• Universal quantum algorithmic cooling on a quantum computer [0.688204255655161]
  We show how to universally and deterministically realize a general cooling procedure with shallow quantum circuits. Our work paves the way for efficient and universal quantum algorithmic cooling with near-term as well as universal fault-tolerant quantum devices.
  arXiv  Detail & Related papers  (2021-09-30T17:50:39Z)
• Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms [55.41644538483948]
  We provide the first complete characterization of sources of error in a neutral-atom quantum computer. We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace. Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
  arXiv  Detail & Related papers  (2021-05-27T23:29:53Z)
• Taking the temperature of a pure quantum state [55.41644538483948]
  Temperature is a deceptively simple concept that still raises deep questions at the forefront of quantum physics research. We propose a scheme to measure the temperature of such pure states through quantum interference.
  arXiv  Detail & Related papers  (2021-03-30T18:18:37Z)
• Preparing random states and benchmarking with many-body quantum chaos [48.044162981804526]
  We show how to predict and experimentally observe the emergence of random state ensembles naturally under time-independent Hamiltonian dynamics. The observed random ensembles emerge from projective measurements and are intimately linked to universal correlations built up between subsystems of a larger quantum system. Our work has implications for understanding randomness in quantum dynamics, and enables applications of this concept in a wider context.
  arXiv  Detail & Related papers  (2021-03-05T08:32:43Z)
• Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
  Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems. We propose an algorithm to implement imaginary time propagation on a quantum computer.
  arXiv  Detail & Related papers  (2021-02-24T12:48:00Z)
• Continuous-time dynamics and error scaling of noisy highly-entangling quantum circuits [58.720142291102135]
  We simulate a noisy quantum Fourier transform processor with up to 21 qubits. We take into account microscopic dissipative processes rather than relying on digital error models. We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
  arXiv  Detail & Related papers  (2021-02-08T14:55:44Z)

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.