00:12:39 Apparently it is its own inverse. 00:12:46 It wasn't its own inverse before... 00:13:18 Maybe I have to say "However two [Hadamard] gates linked sequentially produce an output that is the inverse of the input, and thus behave in the same way as the classical NOT gate." again before it'll work. 00:13:25 your simulator broke :) 00:14:58 "The Hadamard gate is idempotent, ie it is equal to its own inverse"... argh. 00:16:11 haha 00:16:39 but that's just plain wrong! 00:18:46 -!- AndrewNP has joined. 00:19:12 (something)->H->H->H->H == (something), no? 00:19:50 yes 00:20:45 ...Okay, this makes no sense. 00:21:44 Putting the "control" half of a CNOT gate between these Hadamard gates makes them act differently. 00:21:49 Like, it's not supposed to do that. 00:22:44 "So if we apply [Hadamard] twice to any qubit (in any state) we get back to where we started." 00:22:51 http://www-128.ibm.com/developerworks/linux/library/l-quant.html 00:23:21 clearly cnot changed the state of the control qubit 00:24:45 That's not supposed to happen... 00:28:05 then your simulator is broken? :) 00:33:40 * AndrewNP reads the channel log 00:33:58 Okay, so I get most of this. But... how do the complex probabilities work for qubit states? 00:34:19 The probability is the absolute value of the amplitude squared. 00:34:34 That is, the square of the absolute value. 00:35:21 That much I can tell; what I'm wondering is, if two states have the same "latitude" on the Bloch sphere... 00:35:32 It's the same ratio of |0> to |1>... so what's the difference? 00:36:13 Well, the Hadamard gate acts differently when applied to different "kinds" of even superpositions of |0> and |1>. 00:36:39 At least, it used to. Then it stopped working. :-P 00:37:21 Ah. Looking at the Wikipedia page for that thing... all this notation is still new to me. Maybe I should just download the QCL and plow ahead... 00:37:45 Nothing like blind groping to achieve wisdom! XD 00:39:04 or orgasm 00:55:39 -!- GregorR-W has quit ("Chatzilla 0.9.73 [Firefox 1.5.0.2/0000000000]"). 01:14:36 -!- jix has quit ("Bitte waehlen Sie eine Beerdigungnachricht"). 01:38:54 -!- bsmntbombdood has joined. 02:23:05 Oh, let's see here... 02:23:43 |00> -> |00>; |01> -> |01>; |10> -> |10>; |11> -> i|11> 02:27:10 What's the -> stand for? 02:39:05 That's a function which maps |00> onto |00>, |11> onto i|11>, etc. 02:39:47 Oh. So... nothing special, just a function. 02:40:04 Right. 02:45:47 And I don't know how to construct it... 02:46:52 * AndrewNP is still studying this thing... 02:47:23 Hm. Well, constructing the transform matrix is easy enough. But I don't know how you'd do it with the default gates. 02:47:42 Alas, I'm among the unenlightened who don't have Linux, so I can't use that qcl thing. 02:47:57 So... I dunno what sort of capabilities it provides. 02:48:49 Well, it seems to be a matter of constructing controlled gates and such. 02:57:36 Hm. It looks like you can actually define custom gates for 1 to 3 qubits in QCL. 02:58:57 It's a bit cheap, relative to composing the Hadamard and C-not gates, but it gets the job done. 03:00:29 Unless your goal IS to do it with only the Hadamard, CNOt, and phase thingy. 03:00:37 In which case you're on your own, buddy. ;-) 03:09:43 -!- calamari has joined. 03:10:17 hi 03:10:31 Ihay 03:11:15 big G! 03:11:25 Little c! 03:11:30 hehe 03:12:02 Hiyo! 03:12:40 Unrecognized nick! 03:13:12 Who, me? Eh, I'm relatively new anyhow. 03:13:25 Hence the unrecognition :-P 03:13:28 ^^ 03:27:11 -!- ihope_ has quit (Read error: 110 (Connection timed out)). 04:46:49 -!- Sgeo has quit ("Ex-Chat"). 05:10:23 -!- AndrewNP has quit. 05:19:15 -!- Arrogant has joined. 06:05:24 -!- GregorR has quit (Read error: 110 (Connection timed out)). 06:50:07 -!- GregorR has joined. 06:51:42 -!- calamari has quit (Remote closed the connection). 06:56:04 -!- Arrogant has quit ("Leaving"). 07:59:59 -!- clog has quit (ended). 08:00:00 -!- clog has joined. 10:12:40 -!- bsmntbombdood has quit ("all your basment are belong to bsmntbombdood"). 11:34:55 -!- tgwizard has joined. 12:20:47 -!- jix has joined. 14:54:13 -!- ihope_ has joined. 14:54:15 -!- ihope_ has changed nick to ihope. 16:22:13 -!- GregorR-W has joined. 16:22:32 * GregorR-W considers whether it's wise to join ##brainfuck from work :P 16:23:11 -!- kipple has joined. 16:54:42 'Course it is, maybe... or not... hmm. 16:55:43 I occasionally join channels to ask legit work-related questions too :P 16:55:49 Don't want them /whois'ing that out of me. 16:59:24 -!- pikhq has quit (Read error: 104 (Connection reset by peer)). 16:59:27 -!- nickv111 has quit (Read error: 104 (Connection reset by peer)). 17:00:59 -!- pikhq has joined. 17:01:02 -!- nickv111 has joined. 17:19:48 helo 17:21:18 Hola. 17:21:57 Vamos a mirar esta (or something like that): http://nedmposter.ytmnd.com/ 17:21:59 :-) 17:22:20 you know 17:22:27 i'm on a channel on another network 17:22:31 where there's a rule 17:22:33 ytmnd = ban 17:23:02 What chan? 17:23:07 I want to go praise them for their wisdom. 17:23:39 #zdoom on OFTC 17:23:51 not generally a wise channel, but they do have their pluses :) 17:24:11 lol 17:35:35 A pretty good YTMND: http://content.ytmnd.com/ :-P 18:01:42 Okay, let's see here... 18:37:08 -!- EgoBot has joined. 18:37:42 !help 18:37:44 help ps kill i eof flush show ls bf_txtgen usertrig daemon undaemon 18:37:46 1l 2l adjust axo bch bf{8,[16],32,64} funge93 fyb fybs glass glypho kipple lambda lazyk linguine malbolge pbrain rail rhotor sadol sceql trigger udage01 unlambda whirl 18:38:46 !bf_txtgen 18:38:48 sablevm: cannot create vm 18:40:18 !bf_txtgen Pizza 18:40:22 sablevm: cannot create vm 18:40:26 Heheh. 18:41:09 Sorry, I borked bf_txtgen and never fixed it :P 18:41:21 I put in resource limitations, and it seems that sablevm needs more than 100MB X_X 18:44:09 sablevm? 18:44:26 OSS java VM 18:59:23 sablevm is so out of fashion now, cacao is the one now :) 19:03:03 I'm sorry I don't keep up with terrible-language technology. 19:03:49 GregorR-W: you can compile python to the same bytecode 19:04:53 Still affects me none at all :P 19:10:37 Argh. 19:10:56 * pikhq is getting some midly. . . Odd bugs in his code. . . 19:11:10 What sort of bugs? 19:11:18 #iZlude #iZlude Zha b[30000];Zha *p=b;mai(){ 19:11:23 Does that look right to you? 19:11:35 It looks like gibberish to me :-P 19:11:57 It's supposed to be the first few lines of a compilation from Brainfuck to C. 19:12:13 Well, isn't #iZlude supposed to be #include? 19:12:21 Yes. 19:12:45 And what's Zha? 19:12:51 What I *really* don't get is how the letter n changes from Z to null. . . 19:12:52 char 19:13:35 Methinks I might have fucked up BFC's variable code a bit when I tried making the output Brainfuck code smaller. . . 19:13:44 Okay, so you have a character array of length 30000 and a pointer to it? 19:13:52 Yup. 19:14:47 Okay. And what's main? 19:15:31 Do you not know C? 19:15:42 main is main. -_-' 19:15:48 I mean what's in it. 19:16:07 That would be the rest of the compilation of the Brainfuck code. . . 19:16:30 * pikhq wonders why in the world n, d, o, /n, c, and r aren't right at all. . . 19:16:55 Is your entire program just that up there, the stuff in main, and the closing brace? 19:18:41 My entire program is a large series of Brainfuck code, which is supposed to output that. . . 19:29:10 I can't help but think that somewhere, somehow, I've switched > and <. . . 19:36:04 -!- CXI has quit (Connection timed out). 19:37:10 Hmm... 19:37:37 Let D = the reciprocal of the square root of two. 19:39:25 If we have a qubit Q, which is either |0>, |1>, D(|0> + |1>), or D(|0> - |1>), then we run it through CNOT using it as the control and |0> as the main input, then we apply the Hadamard to the output of the CNOT and measure both qubits, what happens? 19:42:11 -!- Sgeo has joined. 19:47:26 who knows? 19:47:59 Well, I might as well call the Hadamard on |0> |+> and the one on |1> |->. 19:49:14 So if we pass in a |0>, we get |0+>, if we pass in a |1>, we get |1->, if we pass in a |+>, we get |+0>, and if we pass in |->, we get |-1>. 19:50:49 Argh, so much PR today X_X 19:51:01 I DON'T WANT TO BUILD MONO *sobs* 20:17:37 This still doesn't make sense. 20:18:10 Wait... 20:18:23 Oh, right. Negating |+> gives |+>. 20:19:44 Apparently Hadamarding the first qubit of a directly entangled |++> does not give |0+>... 20:21:50 Well, let's run through it manually. We have D(|00> + |11>), and doing Hadamard on that first qubit gives D(|+0> + |-1>), which is equal chance |+0> and |-1>, which in turn is equal chance |00>, |10>, |01>, and |11>, the last of which has negative amplitude. 20:22:16 By "let's" you of course mean "let me", since nobody else is paying attention. 20:22:40 Yes. When talking in math, "we" means "I" :-) 20:38:25 because math is a game for kings 20:54:58 -!- bsmntbombdood has joined. 20:55:33 . . . 21:03:07 ? ? ? 21:03:18 :-P 21:15:50 Wow, Mono failed on 6/8 platforms :( 21:20:19 tried Mico? 21:21:28 ? 21:22:03 j/k, in spanish mico = mono and there happens to be a corba library called mico 21:22:10 GregorR-W: 6/8? 21:23:08 Yeah, six out of eight. 21:23:37 GregorR-W: and what does "failed" mean? 21:23:46 Didn't successfully compile. 21:24:00 Mono itself, not some app. 21:24:09 GregorR-W: which bug numbers are these? 21:24:39 #asking_in_mono_1, #asking_in_mono_2, #asking_in_mono_3 21:24:43 ? 21:24:52 I'm asking in #mono before submitting bugs ;) 21:25:12 ok, i have a friend who does some mono hacking at work 21:27:16 What do you think I'm doing? :P 21:27:33 heh ok :) 21:28:52 The -W stands for (at) Work :) 21:54:39 What about -L? 21:54:57 Laptop 21:55:59 -!- Sgeo has quit ("Ex-Chat"). 22:06:51 -!- bsmntbombdood has quit (Client Quit). 22:09:40 Screw it. BFC is too damned inefficient. I'm rewriting basm in pure Brainfuck. 22:51:20 -!- tgwizard has quit ("Leaving"). 22:55:32 Use c2bf! It's even less efficient! 22:55:36 -!- kipple has quit (Read error: 145 (Connection timed out)). 23:01:19 No tha. . . You can do that?!? 23:01:38 I'm writing in pure Brainfuck, for optimal brain fucking experience. :p 23:02:52 c2bf == my baby 23:02:57 Neglected baby :P 23:06:00 Dear God. . . 23:06:12 Part of me wants to run away in horror. The other part is far too curious. 23:06:16 Link? 23:06:46 http://svn.sourceforge.net/viewcvs.cgi/brainfuck/c2bf/trunk/ 23:06:50 No webpage, just files :P 23:08:36 Does it self-host? 23:09:15 It's far from complete :( 23:09:24 (That's a no) 23:09:32 cc/tests/test10.c is the best it can do so far. 23:09:53 The heap/static space doesn't work properly, and I haven't had time/care to look at it. 23:18:24 The one thing you may want to take from things that compile to BF is the function form. Since BF doesn't support functions inherantly, it's handy to steal one of the premade methods. 23:18:38 Or just don't use functions :) 23:24:24 No inherent functions? 23:24:54 I need those! 23:25:09 Then you're in the wrooooooooong channel X-P 23:25:26 No, ##brainfuck is the wrong channel :-P 23:25:49 True 23:25:55 * GregorR-W hands ihope Glass :P 23:26:24 Thanks... 23:26:37 * ihope secretly ditches Glass and ponders Unlambda 23:26:47 :P 23:27:18 I'm actually wondering how to do something like "while input != 255" right now. . . 23:27:35 What's the bitwidth? 23:27:48 Or the wordwidth in bits, or whatever. 23:28:24 Bitwidth dependency is bad, ihope :) 23:29:01 In that case, pretty much all the BF programs out there are bad :-P 23:29:08 I think you want: duplicate, subtract 255 (ow), not (duplicate and not are algos on the wiki) 23:29:46 It's brainfuck, so (at least on this self-hosting compiler) all cells are chars. . . 23:29:50 ihope: Shockingly, c2bf produces non-bitwidth-dependent code. Though the bitwidth does limit how much memory it has, so it'll only work on an 8-bit interp if it only needs 256 bytes XP 23:30:54 So how does it do on a 0-bitwidth thing? :-P 23:31:19 It doesn't run, because 0-bitwidth means that it's not capable of storing anything. ;) 23:36:24 -!- bsmntbombdood has joined. 23:36:39 GregorR-W: And, after that, enter the loop, right? 23:37:11 After what? 23:37:16 OH 23:37:21 Right, yeah. 23:37:37 Then do the same action at the end of the loop 23:37:54 Mmkay. 23:38:12 http://esolangs.org/wiki/Brainfuck_constants Most useful page ever. 23:38:23 Heh 23:40:57 -!- sekhmet has quit (Read error: 110 (Connection timed out)). 23:41:43 b 23:41:46 I think I should write the bfbasic/c2bf method of implementing functions into the wiki. 23:42:02 Actually, I should make a wiki page for C2BF XD 23:43:54 * pikhq needs to set that down. . . 23:45:30 Set what down? 23:50:34 Let's see here... for a controlled-U gate, copy the main input and apply U to one copy, so you have the control, the input, and the results of the gate... 23:51:23 Oh, I'll just implement controlled-not and stuff using H and controlled-V. 23:56:14 -!- sekhmet has joined.