Nothing Special   »   [go: up one dir, main page]

Wu et al., 2022 - Google Patents

Estimating Gibbs partition function with quantum Clifford sampling

Wu et al., 2022

View PDF
Document ID
16078509130875999512
Author
Wu Y
Wang J
Publication year
Publication venue
Quantum Science and Technology

External Links

Snippet

The partition function is an essential quantity in statistical mechanics, and its accurate computation is a key component of any statistical analysis of quantum systems and phenomena. However, for interacting many-body quantum systems, its calculation generally …
Continue reading at arxiv.org (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/11—Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F19/00—Digital computing or data processing equipment or methods, specially adapted for specific applications
    • G06F19/70—Chemoinformatics, i.e. data processing methods or systems for the retrieval, analysis, visualisation, or storage of physicochemical or structural data of chemical compounds
    • G06F19/708—Chemoinformatics, i.e. data processing methods or systems for the retrieval, analysis, visualisation, or storage of physicochemical or structural data of chemical compounds for data visualisation, e.g. molecular structure representations, graphics generation, display of maps or networks or other visual representations
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass
    • G06N99/002—Quantum computers, i.e. information processing by using quantum superposition, coherence, decoherence, entanglement, nonlocality, teleportation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F19/00—Digital computing or data processing equipment or methods, specially adapted for specific applications
    • G06F19/10—Bioinformatics, i.e. methods or systems for genetic or protein-related data processing in computational molecular biology
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass
    • G06N99/005—Learning machines, i.e. computer in which a programme is changed according to experience gained by the machine itself during a complete run
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management

Similar Documents

Publication Publication Date Title
Bharti et al. Noisy intermediate-scale quantum algorithms
Stair et al. A multireference quantum Krylov algorithm for strongly correlated electrons
Tantivasadakarn et al. Hierarchy of topological order from finite-depth unitaries, measurement, and feedforward
Huang et al. Near-term quantum algorithms for linear systems of equations with regression loss functions
Sidhu et al. Tight bounds on the simultaneous estimation of incompatible parameters
Lamata et al. Quantum autoencoders via quantum adders with genetic algorithms
Coyle et al. Quantum versus classical generative modelling in finance
Lang et al. Unitary transformation of the electronic hamiltonian with an exact quadratic truncation of the baker-campbell-hausdorff expansion
De Melo et al. The power of noisy fermionic quantum computation
Chen et al. Hybrid classical-quantum linear solver using Noisy Intermediate-Scale Quantum machines
Inglis et al. Entanglement at a two-dimensional quantum critical point: a T= 0 projector quantum Monte Carlo study
Wu et al. Estimating Gibbs partition function with quantum Clifford sampling
Melnikov et al. Quantum state preparation using tensor networks
Zulehner et al. Introducing design automation for quantum computing
Rieffel et al. From ansätze to Z-gates: A NASA view of quantum computing
Huang et al. Efficient quantum imaginary time evolution by drifting real-time evolution: an approach with low gate and measurement complexity
Cao et al. Mitigating algorithmic errors in quantum optimization through energy extrapolation
Lopez-Piqueres et al. Symmetric tensor networks for generative modeling and constrained combinatorial optimization
Leadbeater et al. Non-unitary Trotter circuits for imaginary time evolution
Dunjko et al. Quantum mixing of Markov chains for special distributions
Hohenstein et al. Efficient quantum analytic nuclear gradients with double factorization
Kiser et al. Classical and quantum cost of measurement strategies for quantum-enhanced auxiliary field quantum monte carlo
Selisko et al. Extending the variational quantum eigensolver to finite temperatures
Weaving et al. A stabilizer framework for the contextual subspace variational quantum eigensolver and the noncontextual projection ansatz
Xie et al. Probabilistic imaginary-time evolution algorithm based on nonunitary quantum circuits