default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStijn De Baerdemacker
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j10]Daria Tolstykh
, Laurent Lemmens, Stijn De Baerdemacker, Dimitri Van Neck, Patrick Bultinck, Guillaume Acke:
Uncovering Clar's aromatic -sextet rule in the Hubbard model using Maximum Probability Domain Partitions. J. Comput. Chem. 43(7): 457-464 (2022)
2010 – 2019
- 2019
- [c4]Alexis De Vos, Stijn De Baerdemacker:
A Birkhoff Connection Between Quantum Circuits and Linear Classical Reversible Circuits. RC 2019: 23-33 - 2018
- [b1]Alexis De Vos, Stijn De Baerdemacker, Yvan Van Rentergem:
Synthesis of Quantum Circuits vs. Synthesis of Classical Reversible Circuits. Synthesis Lectures on Digital Circuits and Systems, Morgan & Claypool Publishers 2018, ISBN 978-3-031-79894-8 - [c3]Alexis De Vos, Stijn De Baerdemacker:
A Unified Approach to Quantum Computation and Classical Reversible Computation. RC 2018: 133-143 - 2016
- [j9]Alexis De Vos, Stijn De Baerdemacker:
The Decomposition of U(n) into XU(n) and ZU(n). J. Multiple Valued Log. Soft Comput. 26(1-2): 141-156 (2016) - 2015
- [j8]Sebastian Wouters, Ward Poelmans, Stijn De Baerdemacker, Paul W. Ayers, Dimitri Van Neck:
CheMPS2: Improved DMRG-SCF routine and correlation functions. Comput. Phys. Commun. 191: 235-237 (2015) - 2014
- [j7]Alexis De Vos, Stijn De Baerdemacker:
Matrix Calculus for Classical and Quantum Circuits. ACM J. Emerg. Technol. Comput. Syst. 11(2): 9:1-9:11 (2014) - [j6]Alexis De Vos, Stijn De Baerdemacker:
Scaling a Unitary Matrix. Open Syst. Inf. Dyn. 21(4) (2014) - [c2]Alexis De Vos, Stijn De Baerdemacker:
The Decomposition of U(n) into XU(n) and ZU(n). ISMVL 2014: 173-177 - 2013
- [j5]Alexis De Vos, Stijn De Baerdemacker:
The NEGATOR as a Basic Building Block for Quantum Circuits. Open Syst. Inf. Dyn. 20(1) (2013) - 2012
- [j4]Alexis De Vos, Michiel Boes, Stijn De Baerdemacker:
Reversible Computation, Quantum Computation, and Computer Architectures in Between. J. Multiple Valued Log. Soft Comput. 18(1): 67-81 (2012) - [c1]Alexis De Vos, Stijn De Baerdemacker:
The Roots of the NOT Gate. ISMVL 2012: 167-172 - 2011
- [j3]Brecht Verstichel, Helen van Aggelen, Dimitri Van Neck, Patrick Bultinck, Stijn De Baerdemacker:
A primal-dual semidefinite programming algorithm tailored to the variational determination of the two-body density matrix. Comput. Phys. Commun. 182(6): 1235-1244 (2011) - [j2]Alexis De Vos, Stijn De Baerdemacker:
Symmetry Groups for the Decomposition of Reversible Computers, Quantum Computers, and Computers in between. Symmetry 3(2): 305-324 (2011) - 2010
- [j1]Alexis De Vos, Stijn De Baerdemacker:
Decomposition of a Linear Reversible Computer: Digital Versus Analog. Int. J. Unconv. Comput. 6(3-4): 239-263 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
