Daan Camps

Daan Camps

Auto-generated profile, based on publicly available information

Daan Camps

National Energy Research Scientific Computing Center, Lawrence Berkeley National Laboratory, Berkeley, Usa

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 March 2024 in SIAM Journal on Matrix Analysis and Applications
Verified
Journal Article
Closed access
DCDaan Camps
Daan Camps
LLLin Lin
Lin Lin
RBRoel Van Beeumen
Roel Van Beeumen
CYChao Yang
Chao Yang
Many standard linear algebra problems can be solved on a quantum computer by using recently developed quantum linear algebra algorithms that make use of block encodings and quantum eigenvalue/singular value transformations. A block encoding embeds a properly scaled matrix of interest [Formula: see text] in a larger unitary transformation [Formula: see text] that can be decomposed into a product of simpler unitaries and implemented efficiently on a quantum computer. Although quantum algorithms can potentially achieve exponential speedup in solving linear algebra problems compared to the best classical algorithm, such a gain in efficiency ultimately hinges on our ability to construct an efficient quantum circuit for the block encoding of [Formula: see text], which is difficult in general, and not trivial even for well structured sparse matrices. In this paper, we give a few examples on how efficient quantum circuits can be explicitly constructed for some well structured sparse matrices and discuss a few strategies used in these constructions. We also provide implementations of these quantum circuits in MATLAB.

10 March 2022 in Physical Review A
Verified
Journal Article
Closed access
PDF file
EKEfekan Kökcü
Efekan Kökcü
DCDaan Camps
Daan Camps
LOLindsay Bassman Oftelie
Lindsay Bassman Oftelie
JFJ. K. Freericks
J. K. Freericks
WJWibe A. de Jong
Wibe A. de Jong
AKAlexander Kemper
Alexander Kemper
Unitary evolution under a time-dependent Hamiltonian is a key component of simulation on quantum hardware. Synthesizing the corresponding quantum circuit is typically done by breaking the evolution into small time steps, also known as Trotterization, which leads to circuits the depth of which scales with the number of steps. When the circuit elements are limited to a subset of SU(4)—or equivalently, when the Hamiltonian may be mapped onto free fermionic models—several identities exist that combine and simplify the circuit. Based on this, we present an algorithm that compresses the Trotter steps into a single block of quantum gates using algebraic relations between adjacent circuit elements. This results in a fixed depth time evolution for certain classes of Hamiltonians. We explicitly show how this algorithm works for several spin models, and demonstrate its use for adiabatic state preparation of the transverse field Ising model.

8 September 2014 in EURASIP Journal on Advances in Signal Processing
Verified
Journal Article
Open access
PDF file
BHBorbála Hunyadi
Borbála Hunyadi
DCDaan Camps
Daan Camps
LSLaurent Sorber
Laurent Sorber
WPWim Van Paesschen
Wim Van Paesschen
MVMaarten De Vos
Maarten De Vos
LLLieven De Lathauwer
Lieven De Lathauwer
Recordings of neural activity, such as EEG, are an inherent mixture of different ongoing brain processes as well as artefacts and are typically characterised by low signal-to-noise ratio. Moreover, EEG datasets are often inherently multidimensional, comprising information in time, along different channels, subjects, trials, etc. Additional information may be conveyed by expanding the signal into even more dimensions, e.g. incorporating spectral features applying wavelet transform. The underlying sources might show differences in each of these modes. Therefore, tensor-based blind source separation techniques which can extract the sources of interest from such multiway arrays, simultaneously exploiting the signal characteristics in all dimensions, have gained increasing interest. Canonical polyadic decomposition (CPD) has been successfully used to extract epileptic seizure activity from wavelet-transformed EEG data (Bioinformatics 23(13):i10–i18, 2007; NeuroImage 37:844–854, 2007), where each source is described by a rank-1 tensor, i.e. by the combination of one particular temporal, spectral and spatial signature. However, in certain scenarios, where the seizure pattern is nonstationary, such a trilinear signal model is insufficient. Here, we present the application of a recently introduced technique, called block term decomposition (BTD) to separate EEG tensors into rank- (L r ,L r ,1) terms, allowing to model more variability in the data than what would be possible with CPD. In a simulation study, we investigate the robustness of BTD against noise and different choices of model parameters. Furthermore, we show various real EEG recordings where BTD outperforms CPD in capturing complex seizure characteristics.

11 November 2020 in Physical Review A
Verified
Journal Article
Closed access
PDF file
DCDaan Camps
Daan Camps
RBRoel Van Beeumen
Roel Van Beeumen
One of the challenges in quantum computing is the synthesis of unitary operators into quantum circuits with polylogarithmic gate complexity. Exact synthesis of generic unitaries requires an exponential number of gates in general. We propose a novel approximate quantum circuit synthesis technique by relaxing the unitary constraints and interchanging them for ancilla qubits via block encodings. This approach combines smaller block encodings, which are easier to synthesize, into quantum circuits for larger operators. Due to the use of block encodings, our technique is not limited to unitary operators and can be applied for the synthesis of arbitrary operators. We show that operators which can be approximated by a canonical polyadic expression with a polylogarithmic number of terms can be synthesized with polylogarithmic gate complexity with respect to the matrix dimension.

15 September 2020 in Numerical Linear Algebra with Applications
Verified
Journal Article
Closed access
DCDaan Camps
Daan Camps
RBRoel Van Beeumen
Roel Van Beeumen
CYChao Yang
Chao Yang

11 July 2022 in SIAM Journal on Matrix Analysis and Applications
Verified
Journal Article
Closed access
DCDaan Camps
Daan Camps
EKEfekan Kökcü
Efekan Kökcü
LOLindsay Bassman Oftelie
Lindsay Bassman Oftelie
WJWibe A. de Jong
Wibe A. de Jong
AKAlexander F. Kemper
Alexander F. Kemper
RBRoel Van Beeumen
Roel Van Beeumen
Quantum computing is a promising technology that harnesses the peculiarities of quantum mechanics to deliver computational speedups for some problems that are intractable to solve on a classical co...