Published 2013
| Version v1
Journal article
Simulation of sparse qubit systems
Creators
- 1. Technische Universitaet Muenchen, Department Chemie, Lichtenbergstr. 4, 85747 Garching (Germany)
Description
We simulate the effect of unitary transformations on multi-qubit systems. The memory requirements arising from a exponentially growing state space are managed by assuming that the density matrix stays sparse during the simulation. We replace the customary matrix exponentiation with optimized computations in structure-constant Lie algebras. This allows us to better account for efficiency and sparsity while increasing the number of qubits. We present computer experiments with several tens of qubits and explore applications to the simulation of quantum algorithms.
Additional details
Identifiers
Publishing Information
- Journal Title
- Verhandlungen der Deutschen Physikalischen Gesellschaft
- Journal Issue
- Hannover 2013 issue
- Series
- Also available as printed version: Verhandlungen der Deutschen Physikalischen Gesellschaft v. 48(4)
- Journal Page Range
- [1 p.]
- ISSN
- 0420-0195
- CODEN
- VDPEAZ
Conference
- Title
- DPG Spring meeting 2013 of the atomic, molecular, plasma physics and quantum optics section (SAMOP) consisting of the divisions atomic physics, mass spectrometry, molecular physics, quantum optics and photonics
- Dates
- 18-22 Mar 2013
- Place
- Hannover (Germany)
INIS
- Country of Publication
- Germany
- Country of Input or Organization
- Germany
- INIS RN
- 46049182
- Subject category
- S71: CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS;
- Resource subtype / Literary indicator
- Conference
- Descriptors DEI
- ALGORITHMS; COMPUTER CALCULATIONS; COMPUTERIZED SIMULATION; DENSITY MATRIX; EFFICIENCY; HILBERT SPACE; LIE GROUPS; OPTIMIZATION; QUANTUM MECHANICS; QUANTUM STATES; QUBITS
- Descriptors DEC
- BANACH SPACE; INFORMATION; MATHEMATICAL LOGIC; MATHEMATICAL SPACE; MATRICES; MECHANICS; QUANTUM INFORMATION; SIMULATION; SPACE; SYMMETRY GROUPS
Optional Information
- Notes
- Session: Q 41.3 Mi 14:45; No further information available