Current Search:   Pelton, Sabine (x)

View All Items

  • CSV Spreadsheet
(1 - 2 of 2)
Spin Pumping in Lateral Double Quantum Dot Systems
Title
Spin Pumping in Lateral Double Quantum Dot Systems.
Creator
Pelton, Sabine, Mucciolo, Eduardo, Ishigami, Marsahir, Leuenberger, Michael, University of Central Florida
Abstract / Description
Electron transport in single lateral quantum dot (QD) and parallel lateral doublequantum dot (DQD) systems is modeled using semiclassical rate equations. The Zeemaneffect, in conjunction with resonant tunneling, is used to select the spin of electronsinvolved in transport. We show adiabatic spin pumping by periodic variation of thesystems' confining parameters, namely the quantum point contacts (QPCs) dictating theboundaries of the dots, and the gate voltage applied to each dot. The...
Show moreElectron transport in single lateral quantum dot (QD) and parallel lateral doublequantum dot (DQD) systems is modeled using semiclassical rate equations. The Zeemaneffect, in conjunction with resonant tunneling, is used to select the spin of electronsinvolved in transport. We show adiabatic spin pumping by periodic variation of thesystems' confining parameters, namely the quantum point contacts (QPCs) dictating theboundaries of the dots, and the gate voltage applied to each dot. The limitations ofadiabatic spin pumping are subsequently examined by counting the average spin pumpedper cycle when frequency and interdot capacitance are adjusted.
Show less
Date Issued
2012
Identifier
CFE0004334, ucf:49435
Format
Document (PDF)
PURL
http://purl.flvc.org/ucf/fd/CFE0004334
Solving Constraint Satisfaction Problems with Matrix Product States
Title
Solving Constraint Satisfaction Problems with Matrix Product States.
Creator
Pelton, Sabine, Mucciolo, Eduardo, Ishigami, Masa, Leuenberger, Michael, University of Central Florida
Abstract / Description
In the past decade, Matrix Product State (MPS) algorithms have emerged as an efficient method of modeling some many-body quantum spin systems. Since spin system Hamiltonians can be considered constraint satisfaction problems (CSPs), it follows that MPS should provide a versatile framework for studying a variety of general CSPs. In this thesis, we apply MPS to two types of CSP. First, use MPS to simulate adiabatic quantum computation (AQC), where the target Hamiltonians are instances of a...
Show moreIn the past decade, Matrix Product State (MPS) algorithms have emerged as an efficient method of modeling some many-body quantum spin systems. Since spin system Hamiltonians can be considered constraint satisfaction problems (CSPs), it follows that MPS should provide a versatile framework for studying a variety of general CSPs. In this thesis, we apply MPS to two types of CSP. First, use MPS to simulate adiabatic quantum computation (AQC), where the target Hamiltonians are instances of a fully connected, random Ising spin glass. Results of the simulations help shed light on why AQC fails for some optimization problems. We then present the novel application of a modified MPS algorithm to classical Boolean satisfiability problems, specifically k-SAT and max k-SAT. By construction, the algorithm also counts solutions to a given Boolean formula (\#-SAT). For easy satisfiable instances, the method is more expensive than other existing algorithms; however, for hard and unsatisfiable instances, the method succeeds in finding satisfying assignments where other algorithms fail to converge.
Show less
Date Issued
2017
Identifier
CFE0006902, ucf:51713
Format
Document (PDF)
PURL
http://purl.flvc.org/ucf/fd/CFE0006902